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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author /\
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        DHandstand solver = new DHandstand();
        solver.solve(1, in, out);
        out.close();
    }

    static class DHandstand {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int k = in.nextInt();
            char[] str = in.nextLine().toCharArray();
            List<Integer> numCons = new ArrayList<>();
            int cnt = 1;
            for (int i = 0; i < n - 1; i++) {
                if (str[i + 1] == str[i]) {
                    cnt++;
                } else {
                    numCons.add(cnt);
                    cnt = 1;
                }
            }
            numCons.add(cnt);
            int l = numCons.size();
            numCons.add(0);
            numCons.add(0);
            int res = 0;
            if (str[0] == '1') {
                if (k >= l / 2) {
                    out.println(n);
                    return;
                }
                int init = 0;
                for (int i = 0; i < 2 * k + 1; i++) {
                    init += numCons.get(i);
                    res = Math.max(init, res);
                }
                for (int i = 0; i < l / 2 - k; i++) {
                    init -= numCons.get(2 * i);
                    init -= numCons.get(2 * i + 1);
                    init += numCons.get(2 * i + 2 * k + 1);
                    init += numCons.get(2 * i + 2 * k + 2);
                    res = Math.max(res, init);
                }
            } else {
                if (k >= l / 2 + 1) {
                    out.println(n);
                    return;
                }
                int init = 0;
                for (int i = 0; i < 2 * k; i++) {
                    init += numCons.get(i);
                    res = Math.max(init, res);
                }
                for (int i = 0; i < l / 2 - k + 1; i++) {
                    if (i != 0) {
                        init -= numCons.get(2 * i - 1);
                    }
                    init -= numCons.get(2 * i);
                    init += numCons.get(2 * i + 2 * k);
                    init += numCons.get(2 * i + 2 * k + 1);
                    res = Math.max(res, init);
                }
            }
            out.println(res);
        }

    }

    static class Scanner {
        private StringTokenizer st;
        private BufferedReader br;

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public Scanner(String s) {
            try {
                br = new BufferedReader(new FileReader(s));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

    }
}

