# include<stdio.h>
# include<stdlib.h>
# include<string.h>
# include<algorithm>
using namespace std;
struct re{int data,num;}d[1000001];
int sa[100001],rank[100001],height[1000001],trank[1000001],s[1000001],tsa[1000001],sum[1000001];
int T[100001],q[1000001];
int n,k,maxn,ans;
bool cmp(re a,re b){return a.data<b.data;}
bool cmp1(int a,int b){return a<b;}
void dispersed(){
sort(d,d+n,cmp);
//for (int i=0;i<=n-1;i++) printf("%d ",d[i].data);printf("\n\n");
maxn=1;
s[d[0].num]=1;
for (int i=1;i<=n-1;i++){
if (d[i].data!=d[i-1].data) maxn++;
s[d[i].num]=maxn;
}
maxn=n;
}
void sorting(int j){
int i;
memset(sum,0,sizeof(int)*(maxn+5));
for (i=1;i<=n;i++) sum[rank[i+j]]++;
for (i=1;i<=maxn;i++) sum[i]+=sum[i-1];
for (i=n;i>=1;i--) tsa[sum[rank[i+j]]--]=i;
memset(sum,0,sizeof(int)*(maxn+5));
for (i=1;i<=n;i++) sum[rank[i]]++;
for (i=1;i<=maxn;i++) sum[i]+=sum[i-1];
for (i=n;i>=1;i--) sa[sum[rank[tsa[i]]]--]=tsa[i];
}
void get_sa(){
int i,j,p;
for (i=0;i<=n;i++) trank[i+1]=s[i];
for (i=1;i<=n;i++) sum[trank[i]]++;
for (i=1;i<=maxn;i++) sum[i]+=sum[i-1];
for (i=n;i>=1;i--) sa[sum[trank[i]]--]=i;
rank[sa[1]]=1;
for (i=2,p=1;i<=n;i++){
if (trank[sa[i]]!=trank[sa[i-1]]) p++;
rank[sa[i]]=p;
}
for (j=1;j<=n;j*=2){
sorting(j);
trank[sa[1]]=1;
for (i=2,p=1;i<=n;i++){
if (rank[sa[i]]!=rank[sa[i-1]] || rank[sa[i]+j]!=rank[sa[i-1]+j]) p++;
trank[sa[i]]=p;
}
for (i=1;i<=n;i++) rank[i]=trank[i];
}
}
void get_height(){
int i,j;
for (i=1,j=0;i<=n;i++){
if (rank[i]==1) continue;
for (;s[i+j-1]==s[sa[rank[i]-1]+j-1];j++);
height[rank[i]]=j;
if (j>0) j--;
}
}
void get_ans(){
int st=0,en=0,i;
for (i=1;i<k-1;i++){
int mid=lower_bound(q+st,q+en+1,height[i],cmp1)-q;
en=mid; q[en]=height[i]; T[en]=i;
}
for (;i<=n;i++){
if (i-T[st]+1>=k) st++;
int mid=lower_bound(q+st,q+en+1,height[i],cmp1)-q;
en=mid; q[en]=height[i]; T[en]=i;
if (q[st]>ans) ans=q[st];
}
}
int main(){
scanf("%d%d",&n,&k);
for (int i=0;i<=n-1;i++) scanf("%d",&d[i].data),d[i].num=i;
dispersed();
get_sa();
get_height();
get_ans();
printf("%d\n",ans);
/*printf("s:\n");
for (int i=0;i<=n-1;i++) printf("%d ",s[i]); printf("\n");
printf("sa:\n");
for (int i=1;i<=n;i++) printf("%d ",sa[i]); printf("\n");
printf("rank:\n");
for (int i=1;i<=n;i++) printf("%d ",rank[i]); printf("\n");
printf("height:\n");
for (int i=1;i<=n;i++) printf("%d ",height[i]); printf("\n");*/
}