#include <bits/stdc++.h>
using namespace std;

#define INCANT cin.tie(0), ios::sync_with_stdio(false)
#define int long long
#define double long double
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define gcd __gcd
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define sz(x) x.size()
#define all(x) (x).begin(), (x).end()
#define sortv(v) sort(all(v))
#define sortvg(v) sort(all(v), greater<int>())
#define countv(v, c) count(all(v), c)
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload(__VA_ARGS__, repi, _rep)(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for(int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload(__VA_ARGS__, revi, _rev)(__VA_ARGS__)
#define each(i, n) for(auto&& i: n)
#define inv(x) each(i, x) in(i)
#define out(x) cout << (x)
#define space() cout << " "
#define indent() cout << '\n'
#define print(x) out(x), indent()
#define printv(x) each(i, x) out(i), space(); indent()
#define debug(x, ...) cerr << __LINE__ << ": " << #x << ": " << (x) << '\n'
#define YN(x) out((x) ? "YES" : "NO"), indent()
#define Yn(x) out((x) ? "Yes" : "No"), indent()
#define yn(x) out((x) ? "yes" : "no"), indent()

void in(){}
template<typename F, typename... R>
void in(F& f, R&... r){
    cin >> f, in(r...);
}

const int INF = 1e16, MOD = 1e9 + 7, LIMIT = 100001, S_LIMIT = 101;
const int dx[] = {0, 0, 1, 0, -1, -1, 1, 1, -1}, dy[] = {0, -1, 0, 1, 0, -1, -1, 1, 1};
const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int g[S_LIMIT][S_LIMIT] = {};

int lcm(int a, int b){
    return a / gcd(a, b) * b;
}
int modpow(int x, int n){
    return n < 2 ? x : modpow(x * x % MOD, n / 2) * (n % 2 ? x : 1) % MOD;
}
int factorial(int a){
    return a < 2 ? 1 : factorial(a - 1) * a;
}
int modfact(int a){
    return a < 2 ? 1 : factorial(a - 1) * a % MOD;
}
int summation(int a){
    return a < 1 ? 0 : (a * a + a) / 2;
}
int combination(int n, int r){
    int res = 1;
    rep(i, 1, r + 1){
        res *= n--, res /= i;
    }
    return res;
}
int modcomb(int n, int r){
    return modfact(n) * modpow(modfact(r), MOD - 2) % MOD * modpow(modfact(n - r), MOD - 2) % MOD;
}
bool isPrime(int n){
    rep(i, 2, sqrt(n) + 1){
        if(i > 3){
            i++;
        }
        if(!(n % i)){
            return false;
        }
    }
    return true;
}
void warshall(int n){
    rep(i, n){
        rep(j, n){
            rep(k, n){
                chmin(g[j][k], g[j][i] + g[i][k]);
            }
        }
    }
}
vector<int> divisor(int n){
    vector<int> ans;
    rep(i, 1, sqrt(n) + 1){
        if(!(n % i)){
            ans.pb(i);
            if(i * i < n){
                ans.pb(n / i);
            }
        }
    }
    return ans;
}
map<int, int> factorization(int n){
    map<int, int> ans;
    rep(i, 2, sqrt(n) + 1){
        if(i > 3){
            i++;
        }
        while(!(n%i)){
            ans[i]++, n /= i;
        }
    }
    if(n > 1){
        ans[n]++;
    }
    return ans;
}
struct UF{
    vector<int> t;
    UF(int size): t(size, -1){}
    int root(int x){
        return t[x] < 0 ? x : t[x] = root(t[x]);
    }
    int size(int x){
        return -t[root(x)];
    }
    bool isSame(int x, int y){
        return root(x) == root(y);
    }
    bool unite(int x, int y){
        x = root(x), y = root(y);
        if(x != y){
            if(t[y] < t[x]){
                swap(x, y)
            ;}
            t[x] += t[y], t[y] = x;
        }
        return x != y;
    }
};

int a, b, c, k, n, m, l, r, x, y, h, w, res = 0, cnt0 = 0, cnt1 = 0, sum = 0, mx = -INF, mn = INF;
string s, t;

main(){
    INCANT;
    in(n, k, s);
    vector<int> num0, num1;
    num1.pb(0);
    rep(i, s.size()){
        if(s[i] == '0'){
            cnt0++;
        }else{
            cnt1++;
        }
        if(i){
            if(s[i] == '0'){
                if(cnt1){
                    num1.pb(cnt1);
                }
                cnt1 = 0;
            }else{
                if(cnt0){
                    num0.pb(cnt0);
                }
                cnt0 = 0;
            }
        }
    }
    if(cnt0){
        num0.pb(cnt0);
    }
    if(cnt1){
        num1.pb(cnt1);
    }
    num1.pb(0);
    if(s[0] == '1'){
        rep(i, 1, min((int)num1.size(),k + 2)){
            sum += num1[i];
        }
        rep(i, min((int)num0.size(),k)){
            sum += num0[i];
        }
        chmax(res, sum);
        debug(sum);
        rep(i, k, num0.size()){
            sum += num0[i] + num1[i + 2];
            sum -= num0[i - k] + num1[i - k + 1];
            chmax(res, sum);
            debug(sum);
        }
    }else{
        rep(i, 1, min((int)num1.size(),k + 1)){
            sum += num1[i];
        }
        rep(i, min((int)num0.size(),k)){
            sum += num0[i];
        }
        chmax(res, sum);
        rep(i, k, num0.size()){
            sum += num0[i] + num1[i + 1];
            sum -= num0[i - k] + num1[i - k];
            chmax(res, sum);

        }
    }
    out(res);
}


Measured memory_bytes: 1372