#include<bits/stdc++.h>
using namespace std;
//#define int long long
int read(){
    int s=0,w=1;
    char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
    while(ch>='0'&&ch<='9')s=s*10+(ch-'0'),ch=getchar();
    return s*w;
}
void write(int x) {
     if(x<0) putchar('-'),x=-x;
     if(x>9) write(x/10);
     putchar(x%10+'0');
}
int n,k,tip[10005],num[10005],www[10005],ans=1e6,s=1;
deque<int> c;
set<int> j;
int check(){
    for(int i=1;i<=k;i++){
        if(www[i]==num[i]){return 0;}
    }
    return 1;
}
int main(){
    n=read();k=read();
    for(int i=1;i<=n;i++){
        tip[i]=read();
        num[tip[i]]++;
    }
    int pos=1;
    while(pos<=n && s<=n-k+1){
        if(j.size()==k){
            if(check()){if(c.size()<ans){ans=c.size();}}
            memset(www,0,sizeof(www));
            j.clear();
            c.clear();
            if(ans==k){break;}
            s++;
            pos=s;
        }
        if(c.empty()){c.push_back(tip[pos]);j.insert(tip[pos]);www[tip[pos]]++;pos++;}
        else{
            if(c.front()!=tip[pos]){c.push_back(tip[pos]);j.insert(tip[pos]);www[tip[pos]]++;pos++;}
            else{c.pop_front();c.push_back(tip[pos]);pos++;s++;}
        }
    }
    if(ans==1e6){printf("0\n");}
    else{printf("%d\n",ans);}
}