// same two pointer original template optimal logic is use 
// just change with respect to question 
 
#include <bits/stdc++.h>
using namespace std;
 
int main()
{
    int n, k;
    string s;
    cin >> n >> k >> s;
 
    // Store each character and its frequency in the window
    unordered_map<char, int> b;
 
    int i = 0;       // Left pointer of the window
    int maxi = -1;   // Longest valid substring length
 
    // j is the right pointer of the window
    for (int j = 0; j < n; j++)
    {
        // Add the current character to the window
        b[s[j]] = b[s[j]] + 1;
 
        // If distinct characters exceed k, i mean greater than k 
        // shrink the window from the left
        while (b.size() > k) // in two pointer template sum > k same here we put with respect to question 
        {
            b[s[i]] = b[s[i]] - 1; // remove that element // same two pointer template sum = sum - b[i]
 
            // Remove the character from the map
            // if its frequency becomes zero
            if (b[s[i]] == 0)
            {
                b.erase(s[i]);
            }
 
            // Move the left pointer forward
            i++;
        }
 
        // Check if the window has exactly k distinct characters then it will come directly but if the window is greater than only it will go in while loop 
        if (b.size() == k)
        {
            // here calculating the maximum window length 
            maxi = max(maxi, j - i + 1);
        }
    }
 
    // Print the longest valid substring length
    cout << maxi << endl;
 
    return 0;
}

Ly8gc2FtZSB0d28gcG9pbnRlciBvcmlnaW5hbCB0ZW1wbGF0ZSBvcHRpbWFsIGxvZ2ljIGlzIHVzZSAKLy8ganVzdCBjaGFuZ2Ugd2l0aCByZXNwZWN0IHRvIHF1ZXN0aW9uIAoKI2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpCnsKICAgIGludCBuLCBrOwogICAgc3RyaW5nIHM7CiAgICBjaW4gPj4gbiA+PiBrID4+IHM7CgogICAgLy8gU3RvcmUgZWFjaCBjaGFyYWN0ZXIgYW5kIGl0cyBmcmVxdWVuY3kgaW4gdGhlIHdpbmRvdwogICAgdW5vcmRlcmVkX21hcDxjaGFyLCBpbnQ+IGI7CgogICAgaW50IGkgPSAwOyAgICAgICAvLyBMZWZ0IHBvaW50ZXIgb2YgdGhlIHdpbmRvdwogICAgaW50IG1heGkgPSAtMTsgICAvLyBMb25nZXN0IHZhbGlkIHN1YnN0cmluZyBsZW5ndGgKCiAgICAvLyBqIGlzIHRoZSByaWdodCBwb2ludGVyIG9mIHRoZSB3aW5kb3cKICAgIGZvciAoaW50IGogPSAwOyBqIDwgbjsgaisrKQogICAgewogICAgICAgIC8vIEFkZCB0aGUgY3VycmVudCBjaGFyYWN0ZXIgdG8gdGhlIHdpbmRvdwogICAgICAgIGJbc1tqXV0gPSBiW3Nbal1dICsgMTsKCiAgICAgICAgLy8gSWYgZGlzdGluY3QgY2hhcmFjdGVycyBleGNlZWQgaywgaSBtZWFuIGdyZWF0ZXIgdGhhbiBrIAogICAgICAgIC8vIHNocmluayB0aGUgd2luZG93IGZyb20gdGhlIGxlZnQKICAgICAgICB3aGlsZSAoYi5zaXplKCkgPiBrKSAvLyBpbiB0d28gcG9pbnRlciB0ZW1wbGF0ZSBzdW0gPiBrIHNhbWUgaGVyZSB3ZSBwdXQgd2l0aCByZXNwZWN0IHRvIHF1ZXN0aW9uIAogICAgICAgIHsKICAgICAgICAgICAgYltzW2ldXSA9IGJbc1tpXV0gLSAxOyAvLyByZW1vdmUgdGhhdCBlbGVtZW50IC8vIHNhbWUgdHdvIHBvaW50ZXIgdGVtcGxhdGUgc3VtID0gc3VtIC0gYltpXQoKICAgICAgICAgICAgLy8gUmVtb3ZlIHRoZSBjaGFyYWN0ZXIgZnJvbSB0aGUgbWFwCiAgICAgICAgICAgIC8vIGlmIGl0cyBmcmVxdWVuY3kgYmVjb21lcyB6ZXJvCiAgICAgICAgICAgIGlmIChiW3NbaV1dID09IDApCiAgICAgICAgICAgIHsKICAgICAgICAgICAgICAgIGIuZXJhc2Uoc1tpXSk7CiAgICAgICAgICAgIH0KCiAgICAgICAgICAgIC8vIE1vdmUgdGhlIGxlZnQgcG9pbnRlciBmb3J3YXJkCiAgICAgICAgICAgIGkrKzsKICAgICAgICB9CgogICAgICAgIC8vIENoZWNrIGlmIHRoZSB3aW5kb3cgaGFzIGV4YWN0bHkgayBkaXN0aW5jdCBjaGFyYWN0ZXJzIHRoZW4gaXQgd2lsbCBjb21lIGRpcmVjdGx5IGJ1dCBpZiB0aGUgd2luZG93IGlzIGdyZWF0ZXIgdGhhbiBvbmx5IGl0IHdpbGwgZ28gaW4gd2hpbGUgbG9vcCAKICAgICAgICBpZiAoYi5zaXplKCkgPT0gaykKICAgICAgICB7CiAgICAgICAgICAgIC8vIGhlcmUgY2FsY3VsYXRpbmcgdGhlIG1heGltdW0gd2luZG93IGxlbmd0aCAKICAgICAgICAgICAgbWF4aSA9IG1heChtYXhpLCBqIC0gaSArIDEpOwogICAgICAgIH0KICAgIH0KCiAgICAvLyBQcmludCB0aGUgbG9uZ2VzdCB2YWxpZCBzdWJzdHJpbmcgbGVuZ3RoCiAgICBjb3V0IDw8IG1heGkgPDwgZW5kbDsKCiAgICByZXR1cm4gMDsKfQ==

NwoyCmFhYmFhYWI=

7
2
aabaaab