#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
//using mint=modint1000000007;
using mint=modint998244353;
signed main(){
  ll N,M,K;string X;cin>>N>>M>>K>>X;
  vector<vector<mint>>DP(N+1,vector<mint>(M+1));
  vector<mint>T(N+1,1);FOR(i,1,N+1)T[i]=T[i-1]*i;
  FOR(i,K,N+1)DP[i][M]=1;
  RREP(i,M)FOR(n,K,N+1){
    if(X[i]=='0')FOR(j,K,n+1)DP[n][i]+=T[n]/T[j]/T[n-j]*pow_mod(2,(M-1-i)*(n-j),998244353)*DP[j][i+1];
    if(X[i]=='1')REP(j,K)DP[n][i]+=T[n]/T[j]/T[n-j]*DP[n][i+1];
  }
  cout<<DP[N][0].val()<<endl;
  return 0;
}