#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int n,k;
string a;
cin>>n>>k;
cin>>a;
vector<int> prefix(n+1,0);
vector<int> suffix(n+1,0);
for(int i=1;i<=n;i++){
if(a[i-1]=='1'){
prefix[i]=prefix[i-1]+1;
}
else{
prefix[i]=0;
}
}
for(int i=n-1;i>=0;i--){
if(a[i]=='1'){
suffix[i]=suffix[i+1]+1;
}
else{
suffix[i]=0;
}
}
int i=0;
int j=k;
int ans=0;
while(i<n && j<n){
int consecutive = prefix[i]+suffix[j]+k;
ans = max(ans,consecutive);
i++;
j++;
}
cout<<ans<<endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxiaXRzL3N0ZGMrKy5oPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJaW50IG4sazsKCXN0cmluZyBhOwoJY2luPj5uPj5rOwoJY2luPj5hOwoJdmVjdG9yPGludD4gcHJlZml4KG4rMSwwKTsKCXZlY3RvcjxpbnQ+IHN1ZmZpeChuKzEsMCk7Cglmb3IoaW50IGk9MTtpPD1uO2krKyl7CgkJaWYoYVtpLTFdPT0nMScpewoJCQlwcmVmaXhbaV09cHJlZml4W2ktMV0rMTsKCQl9CgkJZWxzZXsKCQkJcHJlZml4W2ldPTA7CgkJfQoJfQoJZm9yKGludCBpPW4tMTtpPj0wO2ktLSl7CgkJaWYoYVtpXT09JzEnKXsKCQkJc3VmZml4W2ldPXN1ZmZpeFtpKzFdKzE7CgkJfQoJCWVsc2V7CgkJCXN1ZmZpeFtpXT0wOwoJCX0KCX0KCQogICAgaW50IGk9MDsKICAgIGludCBqPWs7CiAgICBpbnQgYW5zPTA7CiAgICAKICAgIAogICAgd2hpbGUoaTxuICYmIGo8bil7CiAgICAJaW50IGNvbnNlY3V0aXZlID0gcHJlZml4W2ldK3N1ZmZpeFtqXStrOwogICAgCWFucyA9IG1heChhbnMsY29uc2VjdXRpdmUpOwogICAgCWkrKzsKICAgIAlqKys7CiAgICB9CiAgICBjb3V0PDxhbnM8PGVuZGw7CiAgICAKCXJldHVybiAwOwp9