Educational Codeforces Round 120 (Rated for Div. 2) D. Shuffle

#include<bits/stdc++.h>
using namespace std;
#define int long long 
const int N=1e4+10;
const int mod=998244353;
int n,k,pre[N];char ch[N];
vector<pair<int,int>> v;
int qpow(int a,int b){
    int res=1;
    while(b){
        if(b&1) res=res*a%mod;
        a=a*a%mod;
        b=b>>1;
    }
    return res;
}
int fac[N];
int C(int n,int m){
    if(m<0) return 0;
    return fac[n]%mod*qpow(fac[m],mod-2)%mod*qpow(fac[n-m],mod-2)%mod;
}
int32_t main(){
    fac[0]=1;for(int i=1;i<N;i++) fac[i]=fac[i-1]*i%mod;
    scanf("%d%d",&n,&k);cin>>ch+1;
    for(int i=1;i<=n;i++) pre[i]=pre[i-1]+(ch[i]=='1'?1:0);
    if(k==0||pre[n]<k){
        cout<<1<<endl;
        return 0;
    }
    int now=0,l=1,r=1;
    while(r<n){
        while(r<=n&&pre[r]-pre[l-1]<=k) r++;
        if(r==n+1&&pre[n]-pre[l-1]==k) v.push_back({l,r-1});
        else if(pre[r]-pre[l-1]) v.push_back({l,r-1});
        --r;
        while(pre[r]-pre[l-1]==k) l++;
        // cout<<l<<" "<<r<<endl;
    }
    // for(auto it:v) cout<<it.first<<" "<<it.second<<endl;
    int res=0;
    for(auto it:v){
        int l=it.first,r=it.second;
        res=(res+C(r-l+1,pre[r]-pre[l-1]))%mod;
    }
    for(int i=1;i<v.size();i++){
        int l=v[i-1].first,r=v[i].second;
        while(ch[l]=='0') ++l;while(ch[r]=='0') --r;
        // cout<<l<<" "<<r<<" "<<C(r-l-1,pre[r-1]-pre[l])<<endl;
        res=(res-C(r-l-1,pre[r-1]-pre[l])+mod)%mod;
    }
    cout<<res<<endl;
}