#include <stdio.h>

const int Mod = 998244353;

int main()
{
	int i, N, M, K;
	char X[201];
	scanf("%d %d %d", &N, &M, &K);
	scanf("%s", X);

	int j, k, comb[201][201], sum_comb[201][201], pow[201], cur, prev;
	long long dp[2][201] = {};
	for (i = 1, pow[0] = 1; i <= N; i++) pow[i] = pow[i-1] * 2 % Mod;
	for (i = 1, comb[0][0] = 1; i <= N; i++) {
		for (j = 1, comb[i][0] = 1, comb[i][i] = 1, sum_comb[i][0] = 1; j < i; j++) {
			comb[i][j] = (comb[i-1][j-1] + comb[i-1][j]) % Mod;
			sum_comb[i][j] = (sum_comb[i][j-1] + comb[i][j]) % Mod;
		}
		sum_comb[i][i] = sum_comb[i][i-1] + 1;
	}
	for (i = 0; i <= N; i++) {
		for (j = 0; j <= i; j++) {
			comb[i][j] = (long long)comb[i][j] * pow[N-i] % Mod;
			sum_comb[i][j] = (long long)sum_comb[i][j] * pow[N-i] % Mod;
		}
	}
	for (i = 0, cur = 1, prev = 0, dp[0][N] = 1; i < M; i++, cur ^= 1, prev ^= 1) {
		if (X[i] == '0') {
			for (j = K; j <= N; j++) {
				for (k = j, dp[cur][j] = 0; k <= N; k++) dp[cur][j] += dp[prev][k] * comb[k][j] % Mod;
				dp[cur][j] %= Mod;
			}
		} else for (j = K; j <= N; j++) dp[cur][j] = dp[prev][j] * sum_comb[j][K-1] % Mod;
	}
	
	long long ans = 0;
	for (j = K; j <= N; j++) ans += dp[prev][j];
	printf("%lld\n", ans % Mod);
	fflush(stdout);
	return 0;
}