#include <bits/stdc++.h>
using namespace std;
 
 
void longestKSubstr(string s, int k)
{
 
	int n = s.length();
	int answer = -1;
	for (int i = 0; i < n; i++) {
		for (int j = i + 1; j <= n; j++) {
			unordered_set<char> distinct(s.begin() + i,
										s.begin() + j);
			if (distinct.size() == k) {
				answer = max(answer, j - i);
			}
		}
	}
 
	cout << answer;
}
int main()
{
	string s = "aabacbebebe";
	int k = 3;
 
	// Function Call
	longestKSubstr(s, k);
	return 0;
}
 

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgoKdm9pZCBsb25nZXN0S1N1YnN0cihzdHJpbmcgcywgaW50IGspCnsKCglpbnQgbiA9IHMubGVuZ3RoKCk7CglpbnQgYW5zd2VyID0gLTE7Cglmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgewoJCWZvciAoaW50IGogPSBpICsgMTsgaiA8PSBuOyBqKyspIHsKCQkJdW5vcmRlcmVkX3NldDxjaGFyPiBkaXN0aW5jdChzLmJlZ2luKCkgKyBpLAoJCQkJCQkJCQkJcy5iZWdpbigpICsgaik7CgkJCWlmIChkaXN0aW5jdC5zaXplKCkgPT0gaykgewoJCQkJYW5zd2VyID0gbWF4KGFuc3dlciwgaiAtIGkpOwoJCQl9CgkJfQoJfQoKCWNvdXQgPDwgYW5zd2VyOwp9CmludCBtYWluKCkKewoJc3RyaW5nIHMgPSAiYWFiYWNiZWJlYmUiOwoJaW50IGsgPSAzOwoKCS8vIEZ1bmN0aW9uIENhbGwKCWxvbmdlc3RLU3Vic3RyKHMsIGspOwoJcmV0dXJuIDA7Cn0K