#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001
struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};

int main(){
	
	int N,M,K;
	cin>>N>>M>>K;
	
	string S;
	cin>>S;
	
	vector<mint> dp(N+1,0);
	
	dp[N] = 1;
	
	combi C(10000);
	vector<mint> pow2(500);
	pow2[0] = 1;
	rep(i,499)pow2[i+1] = pow2[i] * 2;
	
	rep(i,M){
		vector<mint> ndp(N+1,0);
		
		rep(j,N+1){
			if(dp[j]==0)continue;
			if(S[i]=='0'){
				for(int k=0;k<=j;k++){
					ndp[j-k] += dp[j] * C.combination(j,k) * pow2[N-j];
				}
			}
			else{
				for(int k=0;k<=min(K-1,j);k++){
					ndp[j] += dp[j] * C.combination(j,k) * pow2[N-j];
				}
				
			}
			
		}
		swap(dp,ndp);
	}
	
	mint ans = 0;
	for(int i=K;i<=N;i++)ans += dp[i];
	
	cout<<ans.val()<<endl;
	
	return 0;
}