#include <bits/stdc++.h>
#define ll long long
#define pii pair <int, int>
#define fi first
#define se second
#define pb push_back

using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 105, mod = 998244353; 
int n, k, m, mk[1<<20], f[N][1<<20]; 
string str; 

void solve () {
	cin >> n >> k >> m; 
	if (m) cin >> str; 
	for (int i = 0;i < (1<<k);i++) mk[i] = __builtin_popcount(i) != (k/2); 
	int t = 0; for (int i = 0;i < m;i++) t = (t<<1)+(str[i]-'0'); 
	int ans = 0, S = (1<<k)-1; 
	for (int i = 0;i < (1<<k-m);i++) {
		if (mk[(t<<k-m)|i]) {
			f[k][(t<<k-m)|i] = 1; 
//			cout << k << " " << ((t<<k-m)|i) << endl; 
		}
	}
	for (int i = k;i < n;i++) {
		for (int j = 0;j < (1<<k);j++) {
			if (!mk[j]) continue; 
			(f[i+1][S&(j<<1)] += f[i][j]) %= mod;
			(f[i+1][S&(j<<1|1)] += f[i][j]) %= mod;
		}
	}
	for (int i = 0;i < (1<<k);i++) if (mk[i]) (ans += f[n][i]) %= mod;
	cout << ans; 
}

signed main () {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int T = 1; 
	while (T--) solve();
	return 0;
}