#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 998244353;
vector<long long> fact, fact_inv, inv;
/*  init_nCk :二項係数のための前処理
    計算量:O(n)
*/
void init_nCk(int SIZE) {
    fact.resize(SIZE + 5);
    fact_inv.resize(SIZE + 5);
    inv.resize(SIZE + 5);
    fact[0] = fact[1] = 1;
    fact_inv[0] = fact_inv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < SIZE + 5; i++) {
        fact[i] = fact[i - 1] * i % mod;
        inv[i] = mod - inv[mod % i] * (mod / i) % mod;
        fact_inv[i] = fact_inv[i - 1] * inv[i] % mod;
    }
}
/*  nCk :MODでの二項係数を求める(前処理 int_nCk が必要)
    計算量:O(1)
*/
long long nCk(int n, int k) {
    if(n < k || n < 0 || k < 0) return 0;
    return fact[n] * (fact_inv[k] * fact_inv[n - k] % mod) %mod;
}
int int_mod(int a, int x){
	if(x == 0) return 1;
	else if(x%2 == 0){
		int t = int_mod(a,x/2);
		return (t*t)%mod;
	}
	else{
		return (int_mod(a,x-1)*a)%mod;
	} 
}
signed main(){
	init_nCk(50000);
	int N,M,K;
	cin>>N>>M>>K;
	string S;
	cin>>S;
	vector<vector<int>> dp(M+1,vector<int>(N+1,0));
	dp[0][N] = 1;
	for(int i=0;i<M;i++)for(int j=0;j<=N;j++){
		if(S[i] == '1'){
			int x = int_mod(2,N-j), y = 0;
			for(int k=0;k<K;k++){
				y += nCk(j,k);
				y %= mod;
			}
			dp[i+1][j] = ((x*y)%mod)*dp[i][j]%mod;
		}
		else{
			for(int k=j;k>=K;k--){
				dp[i+1][k] += dp[i][j]*int_mod(2,N-j)%mod*nCk(j,k)%mod;
				dp[i+1][k] %= mod;
			}
		}
	}
	/*for(vector<int> s:dp){
		for(int x:s){
			cout<<x<<' ';
		}
		cout<<endl;
	}*/
	int ans = 0;
	for(int x:dp[M]){
		ans += x;
		ans %= mod;
	}
	cout<<ans<<endl;
}