import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.util.AbstractMap;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Queue;
import java.util.Set;
import java.util.TreeSet;
import java.util.stream.Collectors;

import static java.util.Comparator.*;				
import static java.util.Comparator.*;

public class Main {
	
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        MyInput in = new MyInput(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        
        Solver solver = new Solver();
        solver.solve(1, in, out);
        
        out.close();
    }
    
    // ======================================================================
    //
    // Ｎ　：　文字列の長さ　　Ｋ　：　操作の回数
    // Ｓ　：　長さが　Ｎ　の文字列（０／１）
    // 
    // １回の操作で指定範囲を反転できる。
    // 最大Ｋ回の反転で、連続する１の最大長はいくつ？
    //
    static class Solver {

    	static int T[] = new int[100010];		// [0]:先頭の１の数  [1]:先頭の０の数  [2]:２番目の１の数　・・・
    	
    	public void solve(int testNumber, MyInput in, PrintWriter out) {
    		int N = in.nextInt();
    		int K = in.nextInt();
    		String S = in.nextString();
    		char c;
    		int now = 1;						// 今、見ている数（0/1）
    		int cnt = 0;						// now がいくつ並んでいるか
    		int j = 0;
    		for(int i=0; i < N; i++) {
    			c = S.charAt(i);
    			if(c == ('0' + now))	cnt++;
    			else {
    				T[j] = cnt;
    				j++;
    				now = 1 - now;				// 0/1 を切り替える
    				cnt = 1;					// カウントを　１　から始める
    			}
    		}
    		if(cnt != 0)	T[j] = cnt;
    		
    		// 尺取り法
    		int ans = 0;
    		int left = 0;
    		int right = 0;
    		int tmp = 0; 
    		int nextLeft, nextRight;
    		for(int i=0; i <= j; i+=2) {
    			nextLeft = i;
    			nextRight = Math.min(i + 2 * K + 1, j+1);
    			
    			// 左端を移動する
    			while(nextLeft > left) {		// 今回は１つだけ移動する
    				tmp -= T[left];				// 範囲から外れた分を引く
    				left++;						// １つ右に移動する
    			}
    			// 右端を移動する
    			while(nextRight > right) {
    				tmp += T[right];			// 範囲に追加された分を足す
    				right++;					// １つ右に移動する
    			}
    			ans = Math.max(ans, tmp);
    		}
    		out.println(ans);
        }
    }
    // ======================================================================
    static class Pair<K, V> extends AbstractMap.SimpleEntry<K, V> {
        /** serialVersionUID. */
        private static final long serialVersionUID = 6411527075103472113L;

        public Pair(final K key, final V value) {
            super(key, value);
        }
     }    
    static class MyInput {
        private final BufferedReader in;
        private static int pos;
        private static int readLen;
        private static final char[] buffer = new char[1024 * 8];
        private static char[] str = new char[500 * 8 * 2];
        private static boolean[] isDigit = new boolean[256];
        private static boolean[] isSpace = new boolean[256];
        private static boolean[] isLineSep = new boolean[256];
 
        static {
            for (int i = 0; i < 10; i++) {
                isDigit['0' + i] = true;
            }
            isDigit['-'] = true;
            isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true;
            isLineSep['\r'] = isLineSep['\n'] = true;
        }
 
        public MyInput(InputStream is) {
            in = new BufferedReader(new InputStreamReader(is));
        }
 
        public int read() {
            if (pos >= readLen) {
                pos = 0;
                try {
                    readLen = in.read(buffer);
                } catch (IOException e) {
                    throw new RuntimeException();
                }
                if (readLen <= 0) {
                    throw new MyInput.EndOfFileRuntimeException();
                }
            }
            return buffer[pos++];
        }
 
        public int nextInt() {
            int len = 0;
            str[len++] = nextChar();
            len = reads(len, isSpace);
            int i = 0;
            int ret = 0;
            if (str[0] == '-') {
                i = 1;
            }
            for (; i < len; i++) ret = ret * 10 + str[i] - '0';
            if (str[0] == '-') {
                ret = -ret;
            }
            return ret;
        }
 
        public long nextLong() {
            int len = 0;
            str[len++] = nextChar();
            len = reads(len, isSpace);
            int i = 0;
            long ret = 0L;
            if (str[0] == '-') {
                i = 1;
            }
            for (; i < len; i++) ret = ret * 10 + str[i] - '0';
            if (str[0] == '-') {
                ret = -ret;
            }
            return ret;
        }
 
       public String nextString() {
        	String ret = new String(nextDChar()).trim();
            return ret;
        }
 
        public char[] nextDChar() {
            int len = 0;
            len = reads(len, isSpace);
            char[] ret = new char[len + 1];
            for (int i=0; i < len; i++)		ret[i] = str[i];
            ret[len] = 0x00;
            return ret;
        }
 
        public char nextChar() {
            while (true) {
                final int c = read();
                if (!isSpace[c]) {
                    return (char) c;
                }
            }
        }
 
        int reads(int len, boolean[] accept) {
            try {
                while (true) {
                    final int c = read();
                    if (accept[c]) {
                        break;
                    }
                    if (str.length == len) {
                        char[] rep = new char[str.length * 3 / 2];
                        System.arraycopy(str, 0, rep, 0, str.length);
                        str = rep;
                    }
                    str[len++] = (char) c;
                }
            } catch (MyInput.EndOfFileRuntimeException e) {
            }
            return len;
        }
 
        static class EndOfFileRuntimeException extends RuntimeException {
        }
    }
}


Measured memory_bytes: 27092