#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
struct combination {
	vector<mint> fact, ifact;
	combination(int n) :fact(n + 1), ifact(n + 1) {
		assert(n < mod);
		fact[0] = 1;
		for (int i = 1; i <= n; ++i) fact[i] = fact[i - 1] * i;
		ifact[n] = fact[n].inv();
		for (int i = n; i >= 1; --i) ifact[i - 1] = ifact[i] * i;
	}
	mint operator()(int n, int k) {
		return com(n, k);
	}
	mint com(int n, int k) {
		//負の二項係数を考慮する場合にコメントアウトを外す
		//if (n < 0) return com(-n, k) * (k % 2 ? -1 : 1);
		if (k < 0 || k > n) return 0;
		return fact[n] * ifact[k] * ifact[n - k];
	}
	mint inv(int n, int k) {
		//if (n < 0) return inv(-n, k) * (k % 2 ? -1 : 1);
		if (k < 0 || k > n) return 0;
		return ifact[n] * fact[k] * fact[n - k];
	}
	mint p(int n, int k) {
		return fact[n] * ifact[n - k];
	}
}c(200005);
map<P, mint>mp;
int n, m, k;
string s;
mint dp(int x, int y) {
	if (true) {
	}
	// checked
	if (mp.count({ x,y }))return mp[{x, y}];
	// end
	if (x == s.size())return 1;

	if ('1' == s[x]) {
		mint get = dp(x + 1, y);
		mint sub = 0;
		rep2(i, y - k + 1, y + 1) sub += c(y, i);
		get *= sub;
		mp[{x, y}] += get;
	}
	else {
		//zeroの数
		rep2(i, k, y + 1) {
			mint get = dp(x + 1, i);
			get *= c(y, i);
			int pw = pow_mod(2, m - x - 1, mod);
			pw = pow_mod(pw, y - i, mod);
			get *= pw;
			mp[{x, y}] += get;
		}
	}
	return mp[{x, y}];
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> m >> k >> s;
	cout << dp(0, n).val() << endl;
	return 0;
}