#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 = 125, mod = 998244353; 
int n, k, m, s[5]; 
string str; 

namespace T1 {
	int mk[1<<22], f[1<<22], g[1<<22]; 
	void solve () {
		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[(t<<k-m)|i] = 1; 
			}
		}
		for (int i = k;i < n;i++) {
			memset(g, 0, sizeof g); 
			for (int j = 0;j < (1<<k);j++) {
				if (!mk[j]) continue; 
				(g[S&(j<<1)] += f[j]) %= mod;
				(g[S&(j<<1|1)] += f[j]) %= mod;
			}
			swap(f, g); 
		}
		for (int i = 0;i < (1<<k);i++) if (mk[i]) (ans += f[i]) %= mod;
		cout << ans; 
	}
}

namespace T2 {
	int f[95][119][119][119], g[95][119][119], mk[N][N], sf[64], ans, sz, sv[7], dt[7][7]; 
	void init () {
		memset(f, 0, sizeof f); memset(g, 0, sizeof g); 
		for (int sn = 0;sn <= (k/2)*sz;sn++) {
			memset(mk, 0, sizeof mk); 
			int ts = (k/2)*(sz-1);
			for (int j = ts;j <= n;j++) mk[0][j]++;  
			for (int i = 0;i < m;i++) {
				ts += str[i]-'0'; 
				for (int j = ts;j <= n;j++) mk[i+1][j]++; 
			}
			mk[m][ts]--; 
			for (int i = sn;i >= 0;i--) for (int j = n%k;j <= k;j++) mk[j][i]++; 
			mk[n%k][sn]--; 
			if (!mk[m][ts]) {
				g[sn][m][ts] = 1;
				for (int i = m;i < k;i++) {
					for (int j = ts;j <= n;j++) {
						if (!mk[i+1][j]) (g[sn][i+1][j] += g[sn][i][j]) %= mod; 
						if (!mk[i+1][j+1]) (g[sn][i+1][j+1] += g[sn][i][j]) %= mod; 
					}
				} 
			}
			
			for (int st = 0;st <= n;st++) {
				if (mk[0][st]) continue; 
				f[sn][st][0][st] = 1; 
				for (int i = 0;i < k;i++) {
					for (int j = 0;j <= n;j++) {
						if (!mk[i+1][j]) (f[sn][st][i+1][j] += f[sn][st][i][j]) %= mod; 
						if (!mk[i+1][j+1]) (f[sn][st][i+1][j+1] += f[sn][st][i][j]) %= mod; 
					}
				}
			}
		}
	}
	void chk () {
		int sd = sv[sz]; 
		for (int i = 1;i < sz;i++) {
			for (int j = 1;j < sz;j++) {
				dt[i][j-1] = f[sd][sv[i]+(sz-i-1)*(k/2)][k][sv[j]+(sz-j)*(k/2)];
			}
		}
		for (int i = 1;i < sz;i++) dt[0][i-1] = g[sd][k][sv[i]+(sz-i)*(k/2)]; //, cout << "CHECK:" << sz << " " << sv[i] << " " << sv[i]+(sz-i)*(k/2) << endl; 
		for (int i = 1;i < sz;i++) dt[i][sz-1] = f[sd][sv[i]+(sz-i-1)*(k/2)][n%k][sv[sz]]; 
		dt[0][sz-1] = g[sd][n%k][sv[sz]]; 
//		cout << "SZ:"; for (int i = 1;i <= sz;i++) cout << sv[i] << " "; cout << endl; 
//		for (int i = 0;i < sz;i++) {
//			for (int j = 0;j < sz;j++) {
//				cout << dt[i][j] << " "; 
//			} cout << endl ;
//		} cout << endl; 
		memset(sf, 0, sizeof sf); 
		sf[0] = 1; 
		for (int i = 1;i < (1<<sz);i++) {
			for (int j = 0;j < sz;j++) {
				if ((i>>j&1)^1) continue; 
				int o = __builtin_popcount((i-(1<<j))&((1<<sz)-(1<<j)))&1 ? -1 : 1;  
				(sf[i] += 1ll*sf[i-(1<<j)]*o*dt[__builtin_popcount(i)-1][j]%mod) %= mod; 
			}
		}
//		cout << sf[(1<<sz)-1] << endl; 	
		(ans += sf[(1<<sz)-1]) %= mod; 
	}
	void dfs (int p, int s) {
		if (p > sz) return chk(); 
		for (int i = s;i < s+k/2 && (p < sz || (i-s <= n%k));i++) {
			sv[p] = i; dfs(p+1, i); 
		}
	}
	void sol () {
		dfs(1, 0); 
	}
	void solve () {
		sz = n/k+1; 
		init(); sol(); 
		for (int i = 0;i < m;i++) str[i] ^= 1; 
		init(); sol(); 
		if (ans < 0) ans += mod; 
		cout << ans; 
	}
}

void solve () {
	cin >> n >> k >> m; 
	if (m) cin >> str; 
	if (k <= 22) {
		T1::solve(); return; 
	}
	T2::solve(); 
}

signed main () {
	int T = 1; 
	while (T--) solve();
	return 0;
}