In this problem, you need to find the longest substring of the given string, such that each character occurs in it no more than k times.
Input
The first line contains two integers n and k (1 ≤ n ≤ 100000, 1 ≤ k ≤ n ) , where n – the number of characters in the string. The second line contains n characters – the given string, consisting only of lowercase Latin letters.
Imprint
In the output file print two numbers – the length of the searched substring and the number of its first character. If there are several solutions, print any one.
Examples
| # |
Input |
Output |
| 1 |
3 1
abb |
2 1 |
| 2 |
5 2
ababa |
4 1 |