#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;

inline int add(int x, int y) {x += y; return x >= mod ? x - mod : x;}
inline int del(int x, int y) {x -= y; return x < 0 ? x + mod : x;}
inline void Add(int &x, int y) {x = add(x, y);}
inline void Del(int &x, int y) {x = del(x, y);}

int n, k, m, a[200];
char s[200];

namespace subtask1 {
	int dp[2][(1 << 22) + 3], opt, ans, cnt[(1 << 22) + 3];
	
	void work() {
		memset(dp, 0, sizeof(dp));
		dp[opt][0] = 1;
		for (int i = 1; i <= n; ++i) {
			opt ^= 1;
			for (int S = 0; S < (1 << k); ++S) dp[opt][S] = 0;
			for (int S = 0, T; S < (1 << k); ++S) {
				if (cnt[S] >= (k / 2)) continue;
				if (i > m || a[i] == 0) {
					T = (S >> 1);
					Add(dp[opt][T], dp[opt ^ 1][S]);
				}
				if (i > m || a[i] == 1) {
					T = (S >> 1) | (1 << (k - 1));
					if (cnt[T] >= (k / 2)) continue;
					Add(dp[opt][T], dp[opt ^ 1][S]);
				}
			}
		}
		for (int S = 0; S < (1 << k); ++S) Add(ans, dp[opt][S]);
	}
	
	void solve() {
		for (int i = 1; i < (1 << k); ++i) cnt[i] = cnt[i ^ (i & -i)] + 1;
		work();
		for (int i = 1; i <= m; ++i) a[i] ^= 1;
		work();
		printf("%d\n", ans);
	}
}

namespace subtask2 {
	const int Mod = 2997;
	struct Hash_Table {
		struct node {
			vector<int> id;
			int val;
		};
		vector<int> q;
		
		
	};
	int st[10], mx, opt;
	
	void work() {
		
	}
	
	void dfs(int t, int lst) {
		if (t > mx) return work(), void();
		for (int i = lst; i < lst + k / 2; ++i) {
			st[t] = i;
			dfs(t + 1, i);
		}
	}
	
	void solve() {
		mx = n / k;
		dfs(1, 0);
		for (int i = 1; i <= m; ++i) a[i] ^= 1;
		dfs(1, 0);
	}
}

int main() {
	scanf("%d%d%d%s", &n, &k, &m, s + 1);
	for (int i = 1; i <= m; ++i) a[i] = s[i] - '0';
	if (k <= 22) subtask1 :: solve();
	else if (n <= 66) subtask2 :: solve();
	return 0;
}