#include<bits/stdc++.h>
using namespace std;

signed main(){

  int n,k;
  cin>>n>>k;
  vector<int> a(n);
  for(auto& ai:a)cin>>ai;

  int ans = n+1;
  int l=0,r=0;
  set<int> st;
  map<int,int> mp;
  for(;l<n;++l){
    bool f = (r<n)&&(st.size()!=k);
    while(f){
      if(a[r]<=k)st.emplace(a[r]);
      mp[a[r]]++;
      r++;
      f = (r<n)&&(st.size()!=k);
    }
    if(st.size()==k){
      ans = min(ans,r-l);
    }
    mp[a[l]]--;
    if(mp[a[l]]==0)st.erase(a[l]);
  }
  cout<<(ans==n+1?0:ans)<<endl;

}
