Banh kem xop

#include<bits/stdc++.h>
using namespace std;
long long m,a,b,c[1000007],one[1000007],n,res,d;
string s;
int main(){
cin>>n;
cin>>s;
s='1'+s;
for(int i=1;i<=n;i++)one[i]=one[i-1]+(s[i]=='1');
cin>>m>>a>>b;
d=a+b;
for(int i=n-d+1;i>=1;i--){
if(one[i+a-1]-one[i-1]==a)c[i]=c[i+d]+1;
res+=(c[i]>=m);
}
cout<<res;
return 0;
}