N people are arranged in a row from left to right.

You are given a string S of length N consisting of `0` and `1`, and a positive integer K.

The i-th person from the left is standing on feet if the i-th character of S is `0`, and standing on hands if that character is `1`.

You will give the following direction at most K times (possibly zero):

Direction: Choose integers l and r satisfying 1 \leq l \leq r \leq N, and flip the l-th, (l+1)-th, ..., and r-th persons. That is, for each i = l, l+1, ..., r, the i-th person from the left now stands on hands if he/she was standing on feet, and stands on feet if he/she was standing on hands.

Find the maximum possible number of consecutive people standing on hands after at most K directions.

Constraints

* N is an integer satisfying 1 \leq N \leq 10^5.
* K is an integer satisfying 1 \leq K \leq 10^5.
* The length of the string S is N.
* Each character of the string S is `0` or `1`.

Input

Input is given from Standard Input in the following format:


N K
S


Output

Print the maximum possible number of consecutive people standing on hands after at most K directions.

Examples

Input

5 1
00010


Output

4


Input

14 2
11101010110011


Output

8


Input

1 1
1


Output

1
import java.io.PrintWriter;
import java.util.Scanner;

public class Main  implements Runnable { //Runnableを実装する

    public static void main(String[] args) {

        new Thread(null, new Main(), "", 16 * 1024 * 1024).start(); //16MBスタックを確保して実行

    }

    public void run() {
		Scanner sc = new Scanner(System.in);
		//Scanner sc = new Scanner("1 1 1");
		int n = Integer.parseInt(sc.next());
		int k = Integer.parseInt(sc.next());
		String str = sc.next();
		char c[] = str.toCharArray();
		int max = 0;
		int state = 0;
		int ci = 1;
		int la[] = new int[n+2];
		la[0] = 0; 
		for(int i = 0; i < n ; i++)
		{
			if((int)(c[i]-'0') == state)
			{
				la[ci]++;
			}
			else
			{
				ci++;
				la[ci] = 1;
				if (state == 0)
				{
					state = 1;
				}
				else
				{
					state = 0;
				}
			}
		}
		ci++;
		for(int i = 0; i < ci ; i=i+2)
		{
			int tmp = 0;
			for (int j = i; j < (i + 2*k+1) && j < ci ; j++)
			{
				tmp += la[j];
			}
			if(tmp > max)
			{
				max = tmp;
			}
		}
		int ans = max;

		//int x, y, z;
		//int n = Integer.parseInt(sc.next());
		//int na[] = new int[n];
		//int ans;
		//for(int i = 0; i < n ; i++)
		//{
		//	na[i] = Integer.parseInt(sc.next());
		//}


		PrintWriter out = new PrintWriter(System.out);

		out.println(ans);
		out.flush();
	}
}