using System;
using System.Collections.Generic;
using System.Text;
using System.Linq;
namespace Practice
{
    class Program
    {
        static void Main(string[] args)
        {
            Solve();
        }
        private const int MOD = 1000000007;
        static void Solve()
        {
            var nk = ReadAndParseLongArr();
            var n = nk[0];
            var k = nk[1];
            var s = Console.ReadLine();

            var s2 = CalcList(s);
            if (s2.Count <= 2)
            {
                Console.WriteLine(n);
                return;
            }
            // 0のグループがK以下なら全部になる
            if( Is0GroupUnderK(s2, s, k))
            {
                Console.WriteLine(n);
                return;
            }
            

            var accum = new long[s2.Count + 1];
            for(int i=0;i<s2.Count;++i)
            {
                accum[i + 1] = accum[i] + s2[i];
                
            }


            long ans = 0;
            if( s[0] == '0')
            {
                for(long i=0;i<s2.Count;i+=2)
                {
                    long l = Math.Max(0, i - 1);
                    long lastAIdx = i + 2 * (k-1);
                    if( lastAIdx >= s2.Count) { break; }
                    long r = Math.Min(accum.Length - 1, lastAIdx + 2);
                    ans = Math.Max(ans, accum[r] - accum[l]);
                }
            }
            else
            {
                for (long i = 1; i < s2.Count; i += 2)
                {
                    long l = i - 1;
                    long lastAIdx = i + 2 * (k - 1);
                    if (lastAIdx >= s2.Count) { break; }
                    long r = Math.Min(accum.Length - 1, lastAIdx + 2);
                    ans = Math.Max(ans, accum[r] - accum[l]);
                }
            }

            Console.WriteLine(ans);
        }

        private static bool Is0GroupUnderK(List<long> s2, string s, long k)
        {
            long cnt = 0;
            if( s[0] == '0')
            {
                if( s2.Count % 2 == 0)
                {
                    cnt = s2.Count / 2;
                }
                else
                {
                    cnt = s2.Count / 2 + 1;
                }
            }
            else
            {
                cnt = s2.Count / 2;
            }
            return cnt <= k;
        }

        private static List<long> CalcList(string s)
        {
            long state = s[0] == '0' ? 0 : 1;
            long curLen = 1;
            var s2 = new List<long>();
            for (int i = 1; i < s.Length; ++i)
            {
                if( state == 0)
                {
                    if(s[i] == '0')
                    {
                        curLen++;
                    }
                    else
                    {
                        s2.Add(curLen);
                        curLen = 1;
                        state = 1;
                    }
                }
                else
                {
                    if( s[i] == '1')
                    {
                        curLen++;
                    }
                    else
                    {
                        s2.Add(curLen);
                        curLen = 1;
                        state = 0;
                    }
                }
            }
            s2.Add(curLen);
            return s2;
        }

        #region よく使う便利関数
        private static bool isPrime(long x)
        {
            if (x == 2) { return true; }
            if (x < 2 || x % 2 == 0) { return false; }
            long i = 3;
            while (i * i <= x)
            {
                if (x % i == 0) { return false; }
                i = i + 2;
            }
            return true;
        }
        private static long lcm(long x, long y)
        {
            return x / gcd(x, y) * y;
        }
        private static long gcd(long x, long y)
        {
            return y > 0 ? gcd(y, x % y) : x;
        }
        private static long pow(long x, long n)
        {
            if (n == 0) { return 1; }
            long res = pow(x * x % MOD, n / 2);
            if (n % 2 == 1)
            {
                res = res * x % MOD;
            }
            return res;
        }
        private static int ReadAndParseInt()
        {
            return int.Parse(Console.ReadLine());
        }
        private static int[] ReadAndParseIntArr()
        {
            return Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);
        }
        private static long ReadAndParseLong()
        {
            return long.Parse(Console.ReadLine());
        }
        private static long[] ReadAndParseLongArr()
        {
            return Array.ConvertAll(Console.ReadLine().Split(' '), long.Parse);
        }

        private static void Swap<T>(ref T x, ref T y)
        {
            T t = x;
            x = y;
            y = t;
        }

        /// <summary>
        /// 指定した値以上の先頭のインデクスを返す
        /// </summary>
        /// <typeparam name="T">比較する値の型</typeparam>
        /// <param name="arr">対象の配列（※ソート済みであること）</param>
        /// <param name="start">開始インデクス [inclusive]</param>
        /// <param name="end">終了インデクス [exclusive]</param>
        /// <param name="value">検索する値</param>
        /// <param name="comparer">比較関数(インターフェイス)</param>
        /// <returns>指定した値以上の先頭のインデクス</returns>
        public static int LowerBound<T>(IReadOnlyList<T> arr, int start, int end, T value, IComparer<T> comparer)
        {
            int low = start;
            int high = end;
            int mid;
            while (low < high)
            {
                mid = ((high - low) >> 1) + low;
                if (comparer.Compare(arr[mid], value) < 0)
                    low = mid + 1;
                else
                    high = mid;
            }
            return low;
        }

        //引数省略のオーバーロード
        public static int LowerBound<T>(IReadOnlyList<T> arr, T value) where T : IComparable
        {
            return LowerBound(arr, 0, arr.Count, value, Comparer<T>.Default);
        }

        /// <summary>
        /// 指定した値より大きい先頭のインデクスを返す
        /// </summary>
        /// <typeparam name="T">比較する値の型</typeparam>
        /// <param name="arr">対象の配列（※ソート済みであること）</param>
        /// <param name="start">開始インデクス [inclusive]</param>
        /// <param name="end">終了インデクス [exclusive]</param>
        /// <param name="value">検索する値</param>
        /// <param name="comparer">比較関数(インターフェイス)</param>
        /// <returns>指定した値より大きい先頭のインデクス</returns>
        public static int UpperBound<T>(IReadOnlyList<T> arr, int start, int end, T value, IComparer<T> comparer)
        {
            int low = start;
            int high = end;
            int mid;
            while (low < high)
            {
                mid = ((high - low) >> 1) + low;
                if (comparer.Compare(arr[mid], value) <= 0)
                    low = mid + 1;
                else
                    high = mid;
            }
            return low;
        }

        //引数省略のオーバーロード
        public static int UpperBound<T>(IReadOnlyList<T> arr, T value)
        {
            return UpperBound(arr, 0, arr.Count, value, Comparer<T>.Default);
        }
        #endregion
    }

    public class DisjointSet
    {
        private int[] rank;
        private int[] p;
        private int[] size;
        public DisjointSet(int n)
        {
            rank = new int[n];
            p = new int[n];
            size = new int[n];
            for (int i = 0; i < n; ++i)
            {
                MakeSet(i);
            }
        }
        public void MakeSet(int x)
        {
            p[x] = x;
            rank[x] = 0;
            size[x] = 1;
        }
        public bool IsSame(int x, int y)
        {
            return FindSet(x) == FindSet(y);
        }
        public void Unite(int x, int y)
        {
            Link(FindSet(x), FindSet(y));
        }
        public void Link(int x, int y)
        {
            if (rank[x] > rank[y])
            {
                p[y] = x;
                size[x] += size[y];
                size[y] = 0;
            }
            else
            {
                p[x] = y;
                size[y] += size[x];
                size[x] = 0;
                if (rank[x] == rank[y])
                {
                    rank[y]++;
                }
            }
        }
        public int FindSet(int x)
        {
            if (x != p[x])
            {
                p[x] = FindSet(p[x]);
            }
            return p[x];
        }
        public int Size(int x)
        {
            int root = FindSet(x);
            return size[root];
        }
    }
}


Measured memory_bytes: 13920