#include <bits/stdc++.h>
using namespace std;
int n,m,k;
string ch;
const int maxn=2e5+5;
int sum[maxn];
int nxt[maxn];
int f[maxn][10];
const int INF=maxn;
bool check(int len){
	for(int i=1;i<=n;i++){
		int l=i,r=l+len-1;
		if(r>n)
			f[i][1]=INF;
		else
			f[i][1]=sum[r]-sum[l-1];
	}
	for(int st=2;st<=k;st++){
		int minn=INF;
		for(int i=n;i>=1;i--){
			int l=i,r=l+len-1;
			int ll=nxt[r+1]+1;
			if(r+1<=n&&ll<=n)
				minn=min(minn,f[ll][st-1]);
			if(r>n)
				f[i][st]=INF;
			else{
				f[i][st]=minn+sum[r]-sum[l-1];
			}
		}
	}
	return f[1][k]<=m;
}
int main(){
	cin>>n>>m>>k;
	cin>>ch;
	for(int i=1;i<=n;i++){
		char tmp=ch[i-1];
		if(tmp=='0')
			sum[i]=1;
		else
			sum[i]=0;
		sum[i]+=sum[i-1];
	}
	nxt[n+1]=n+1;
	for(int i=n;i>=1;i--){
		char tmp=ch[i-1];
		if(tmp=='0')
			nxt[i]=i;
		else
			nxt[i]=nxt[i+1];
	}
	int l=1,r=n;
	int ans=-1;
	while(l<=r){
		int mid=(r-l>>1)+l;
		if(check(mid)){
			l=mid+1;
			ans=mid;
		}
		else
			r=mid-1;
	}
	cout<<ans<<endl;
	
	return 0;
}