#include <iostream>
#include <cstring>
#include <fstream>
#include <algorithm>
#include <deque>

using namespace std;

ifstream fin("substr.in");
ofstream fout("substr.out");

#define mp make_pair
#define f first
#define s second

pair<pair<int,int>,int> curr[170000];
char v[17000];
int w[11][17000];
int ord[17000];
int alike[17000];
int n,i,k;

int cmp(int a,int b)
{
    int cnt = 0;
    while(b<n)
    {
        if(v[a]!=v[b])
            return cnt;
        else
        ++a,++b,++cnt;
    }
    return cnt;
}

int main()
{
    fin>>n>>k;
    fin>>v;
    for(i=0; i<n; ++i)
        w[0][i]=v[i];
    for(k=1; k<=11; ++k)
    {
        for(i=0; i<n; ++i)
            curr[i]=mp(mp(w[k-1][i],w[k-1][i+(1<<(k-1))]),i);
        sort(curr,curr+n);
        int nr = 0;
        for(i=0; i<n; ++i)
            if(i>0 && curr[i].s==curr[i-1].s)
                w[k][i]=nr;
            else
                w[k][i]=nr+1;
    }
    for(i=0; i<n; ++i)
        ord[i]=curr[i].s;
    for(i=1; i<n; ++i)
        alike[i]=cmp(ord[i-1],ord[i]);
    if(k==1)
    {
        fout<<n;
        return 0;
    }
    deque <int> q;
    int ans = 0;
    for(i=1; i<n; ++i)
    {
        while(q.size() && q.front()<=i-k+1)
            q.pop_front();
        while(q.size() && alike[q.back()]>alike[i])
            q.pop_back();
        q.push_back(i);
        ans = max(ans,q.front());
    }
    fout<<ans;
}