#include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define int long long
int n,m,k,id=1;
string s;
const int N=2e5+10;
int dp[N][6][2];
int pre[N];
bool check(int x){
    for(int i=0;i<=n;i++){
        for(int j=0;j<=k;j++){
            dp[i][j][0]=dp[i][j][1]=inf;
        }
    }
    dp[0][0][0]=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=k;j++){
            dp[i][j][1]=dp[i][j][0]=min(dp[i-1][j][0],dp[i-1][j][1]);
            if(i>=x&&j>=1&&dp[i-x][j-1][0]!=inf) dp[i][j][1]=dp[i-x][j-1][0]+pre[i]-pre[i-x];
        }
    }
    int cost=inf;
    cost=min(dp[n][k][1],dp[n][k][0]);
    // if(cost<=m) cout<<x<<" pass "<<cost<<endl;
    return cost<=m;
}
signed main (){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    cin>>n>>m>>k>>s;
    s=" "+s;
    int cnt=0;
    for(int i=1;i<=n;i++){
        if(s[i]=='0') pre[i]=pre[i-1]+1;
        else{
            if(s[i-1]=='0') cnt++;
            pre[i]=pre[i-1];
        }
    }
    if(s.back()=='1') cnt++;
    if(cnt<k){
        cout<<-1<<endl;
        return 0;
    }
    int l=-1,r=s.size()+2;
    while(l+1<r){
        int mid=l+r>>1;
        if(check(mid)) l=mid;
        else r=mid;
    }
    cout<<l<<endl;
}