#include <bits/stdc++.h>
#define maxN 2 * 16386
#define maxL 16
using namespace std;
int ans, n, k, l, cnt, P[maxL][maxN], nr, pos[maxN], val[maxN], Pos[maxN];
char s[maxN];
struct entry
{
    int nr[2], p;
} V[maxN];
bool cmp(const entry &a, const entry &b)
{
    return (a.nr[0] == b.nr[0]) ? (a.nr[1] < b.nr[1]) : (a.nr[0] < b.nr[0]);
}
void read()
{
    freopen("substr.in", "r", stdin);
    scanf("%d %d\n", &n, &k);
    scanf("%s", s);
}
void Radix(int N, int k, int cnt)
{
    for (int i = 0; i < N; ++ i)
    {
        int Pi = (i + cnt) < N ? P[k - 1][i + cnt] : N;
        ++ val[Pi];
    }
    for (int i = 1; i <= N; ++ i)
        val[i] += val[i - 1];
}
void prec(int N)
{
    for (int i = 0; i < N; ++ i)
        val[s[i]] = 1;
    for (int i = 1; i < maxN; ++ i)
        val[i] += val[i - 1];
    for (int i = 0; i < N; ++ i)
        P[0][i] = val[s[i]] - 1;

    for (int k = 1, cnt = 1; cnt < 2 * N; ++ k, cnt <<= 1)
    {
        memset(val, 0, sizeof(val));
        Radix(N, k, cnt);
        for (int i = 0; i < N; ++ i)
        {
            int Pi = (i + cnt) < N ? P[k - 1][i + cnt] : N;
            Pos[-- val[Pi]] = i;
        }
        for (int i = 0; i <= N; ++ i) val[i] = 0;
        Radix(N, k, 0);
        for (int i = N - 1; i >= 0; -- i)
        {
            int j = Pos[i];
            int posi = -- val[P[k - 1][j]];
            V[posi].p = j;
            V[posi].nr[0] = P[k - 1][j];
            V[posi].nr[1] = (j + cnt) < N ? P[k - 1][j + cnt] : maxN;
        }
        int nr = -1;
        for (int i = 0; i < N; ++ i)
        {
            if (i > 0 && V[i].nr[0] == V[i - 1].nr[0] && V[i].nr[1] == V[i - 1].nr[1])
                P[k][V[i].p] = P[k][V[i - 1].p];
            else
                P[k][V[i].p] = i;

            pos[++ nr] = V[i].p;
        }
        l = k;
    }
}
int lcp(int x, int y)
{
    int k, ans = 0;
    if (x == y) return n - x;
    for (k = l; k >= 0 && x < n && y < n; -- k)
        if (P[k][x] == P[k][y])
        {
            x += (1 << k);
            y += (1 << k);
            ans += (1 << k);
        }
    return ans;
}
void solve()
{
    int i, x, y, z;
    prec(n);
    //for ()
    for (i = 0; i <= n - k; ++ i)
    {
        x = pos[i];
        y = pos[i + k - 1];
        z = lcp(x, y);
        if (z > ans)
            ans = z;
    }
}
void write()
{
    freopen("substr.out", "w", stdout);
    printf("%d\n", ans);
}
int main()
{
    read();
    solve();
    write();
    return 0;
}