#include <cstdio>
#include <vector>
#define Nmax 17000
#define P 100021
#define X 6453432

using namespace std;

int N,K;
char a[Nmax];
vector <int> H[P+10];

inline void AdaugaHash(int x)
{
    int i=x%P;
    H[i].push_back(x);
}

inline int CautaHash(int x)
{
    int i=x%P,cnt=0;
    vector<int>::iterator it;
    for(it=H[i].begin();it!=H[i].end();++it)
        if(*it==x)
            ++cnt;
    return cnt;
}

inline bool Ok(int L)
{
    int v=0,aux=1,i;
    for(i=1;i<L;++i)
        aux=(1LL*aux*X)%P;
    for(i=1;i<=L;++i)
        v=(1LL*v*X+a[i]-'0')%P;
    AdaugaHash(v);
    for(i=L+1;i<=N;++i)
    {
        v=(1LL*((v-(1LL*(a[i-L]-'0')*aux)%P+P)%P)*X+a[i]-'0')%P;
        AdaugaHash(v);
    }
    v=0;
    for(i=1;i<=L;++i)
        v=(1LL*v*X+a[i]-'0')%P;
    if(CautaHash(v)>=K)
        return true;
    for(i=L+1;i<=N;++i)
    {
        v=((1LL*((v-(1LL*(a[i-L]-'0')*aux)%P+P))%P)*X+a[i]-'0')%P;
        if(CautaHash(v)>=K)
            return true;
    }
    return false;
}

int main()
{
    int st,dr,mij,sol;
    freopen ("substr.in","r",stdin);
    freopen ("substr.out","w",stdout);
    scanf("%d%d%s", &N,&K,(a+1));
    st=1; dr=2*N;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        if(Ok(mij))
        {
            sol=mij;
            st=mij+1;
        }
        else
            dr=mij-1;
    }
    printf("%d\n", sol);
    return 0;
}