#include <iostream>
#include <algorithm>
#include <string>
using namespace std;

const long long md = 998244353;
long long cb[209][209], d[209][209], r2[209];

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, m, k; cin >> n >> m >> k;
	string x; cin >> x;
	cb[0][0] = r2[0] = 1;
	for (int i = 1; i <= n; i++) {
		r2[i] = (r2[i - 1] * 2) % md;
		for (int j = 0; j <= n; j++) {
			cb[i][j] = cb[i - 1][j];
			if (j) cb[i][j] = (cb[i][j] + cb[i - 1][j - 1]) % md;
		}
	}
	d[0][n] = 1;
	for (int i = 1; i <= m; i++) {
		if (x[i - 1] == '0') {
			for (int j = k; j <= n; j++) {
				for (int pi = j; pi <= n; pi++)
					d[i][j] = (d[i][j] + d[i - 1][pi] * ((cb[pi][j] * r2[n - pi]) % md)) % md;
			}
		}
		else {
			for (int j = 0; j <= n; j++) {
				for (int pi = 0; pi < k && pi <= j; pi++)
					d[i][j] = (d[i][j] + cb[j][pi]) % md;
				d[i][j] = (d[i][j] * d[i - 1][j]) % md;
				d[i][j] = (d[i][j] * r2[n - j]) % md;
			}
		}
	}
	long long ans = 0;
	for (int i = 0; i <= n; i++)
		ans = (ans + d[m][i]) % md;
	cout << ans << '\n';
	return 0;
}