#include #pragma GCC optimize("Ofast") #define _GLIBCXX_DEBUG using namespace std; using std::cout; using std::cin; using std::endl; using ll=long long; using ld=long double; ll ILL=1167167167167167167; const int INF=2100000000; const ll mod=998244353; #define rep(i,a) for (ll i=0;i using _pq = priority_queue, greater>; template ll LB(vector &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();} template ll UB(vector &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();} template bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;} template bool chmax(T &a,const T &b){if(a void So(vector &v) {sort(v.begin(),v.end());} template void Sore(vector &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});} void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";} namespace po167{ struct combination{ std::vector fact; std::vector rev; std::vector fact_rev; long long MOD; combination(int max,long long mod):MOD(mod),fact(max+1),rev(max+1),fact_rev(max+1){ for(long long i=0;i<=max;i++){ if(i<2){ fact[i]=1; fact_rev[i]=1; rev[i]=1; continue; } fact[i]=(fact[i-1]*i)%mod; rev[i]=mod-((mod/i)*rev[mod%i])%mod; fact_rev[i]=(fact_rev[i-1]*rev[i])%mod; } } long long Comb(int x,int y){ if (x>N>>M>>K; string X; cin>>X; combination table(500,mod); vector dp(N+1); dp[N]=1; rep(i,M){ ll tmp=1; rep(j,N+1){ dp[N-j]=(dp[N-j]*tmp)%mod; tmp=(tmp*2ll)%mod; } vector n_dp(N+1); if(X[i]=='0'){ rep(j,N+1){ for(int k=K;k<=j;k++){ n_dp[k]+=(dp[j]*table.Comb(j,k))%mod; n_dp[k]%=mod; } } }else{ rep(j,N+1){ for(int k=min(j,(ll)K-1);k>=0;k--){ n_dp[j]+=(dp[j]*table.Comb(j,k))%mod; n_dp[j]%=mod; } } } dp=n_dp; } ll ans=0; rep(i,N+1) ans=(ans+dp[i])%mod; cout<