C. Vasya and String Codeforces Round 354 (Div. 2)

High school student Vasya got a string of length n as a birthday present. This string consists of letters 'a' and 'b' only. Vasya denotes beauty of the string as the maximum length of a substring (consecutive subsequence) consisting of equal letters.

Vasya can change no more than k characters of the original string. What is the maximum beauty of the string he can achieve?

Input

The first line of the input contains two integers n and k (1 ≤ n ≤ 100 000, 0 ≤ k ≤ n) — the length of the string and the maximum number of characters to change.

The second line contains the string, consisting of letters 'a' and 'b' only.

Output

Print the only integer — the maximum beauty of the string Vasya can achieve by changing no more than k characters.

Examples

input

Copy

4 2
abba

output

Copy

4

input

Copy

8 1
aabaabaa

output

Copy

5

Note

In the first sample, Vasya can obtain both strings "aaaa" and "bbbb".

In the second sample, the optimal answer is obtained with the string "aaaaabaa" or with the string "aabaaaaa".

题目大意：

给长度为n的字符串，可最多更改k个字符，问最长相同字母串在更改后有多长？

思路：

遍历字符串看两个字符各有多长，如果少的字目个数多于k，则抛掉最前面的字符。

方法：

跑单for模拟。

AC代码：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl "\n"

ll n,m;
string s;

void solve(){
	cin >> n >> m >> s;
	ll l=0,a=0,b=0,sum=0;//当前选的字符串头在哪,'a'的个数,'b'个数,最长可取字符串有多长 
	for(ll i = 0 ; i < n ; i ++){
		s[i] == 'a' ? a ++ : b ++;//判定字符 
		if(min(a,b) > m){//看少的字母个数是否大于k 
			s[l++] == 'a' ? a -- : b --;//抛去字符串的第一个字母 
		}
		sum = max(sum,a+b);
	}
	cout << sum << endl;
	return;
}

int main(){
	ll t=1;//cin >> t;
	while(t --)solve();
	return 0;
}