#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define MOD 1000000007
#define MOD2 998244353
#define INF 1000000007
#define LINF 1000000000000000007LL
#define PI 3.14159265359
#define P pair<ll,ll>
template <typename T>
inline bool chmax(T &a, const T &b){
  if(a<b) {a=b; return true;}
  else return false;
}
template <typename T>
inline bool chmin(T &a, const T &b){
  if(a>b) {a=b; return true;}
  else return false;
}
struct Edge{
  int to; ll cost;
  Edge(int to, ll cost) : to(to), cost(cost) {}
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
void add_edge(Graph &g,int from,int to,ll cost,bool rev,ll rev_cost){
  g[from].push_back(Edge(to,cost));
  if(rev) g[to].push_back(Edge(from,rev_cost));
}

//xのn乗
ll mod_pow(ll x, ll n, ll m) {// O(log(n))
    ll res = 1;
    while (n > 0) {//繰り返し二乗法
        if (n & 1) res = res * x % m;
        x = x * x % m;
        n >>= 1;
    }
    return res;
}

const int MAX = 510000; // 5*(10^5)

ll fac[MAX], finv[MAX], inv[MAX];

void init_nCk(int m) {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % m;
        inv[i] = m - inv[m%i] * (m / i) % m;
        finv[i] = finv[i - 1] * inv[i] % m;
    }
}

ll nCk(int n, int k,int m){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % m) % m;
}

ll nPk(int n, int k, int m){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n]*finv[n-k]%m;
}

ll dp[210][210];

void solve(){
  init_nCk(MOD2);
  int n,m,k;
  string x;
  cin>>n>>m>>k>>x;
  dp[0][n]=1;
  rep(b,m){
    for(int j=n; j>=k; j--){
      if(x[b]=='0'){
        for(int i=0; i<=n-k; i++){
          dp[b+1][j] += dp[b][j+i]*nCk(j+i,i,MOD2)%MOD2*mod_pow(2,(m-b-1)*i,MOD2)%MOD2;
          dp[b+1][j]%=MOD2;
        }
      }
      if(x[b]=='1'){
        for(int i=0; i<=k-1; i++){
          dp[b+1][j] += dp[b][j] * nCk(j,i,MOD2) %MOD2;
          dp[b+1][j] %=MOD2;
        }
      }
    }
  }
  ll ans=0;
  for(int j=n; j>=k; j--){
    ans += dp[m][j];
    ans %=MOD2;
  }
  cout<<ans<<'\n';
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout<<setprecision(10)<<fixed;
  solve();
  return 0;
}