#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define all(a) begin(a),end(a)
#ifdef DEBUG
template<class T>
ostream& operator << (ostream &out,vector<T> a){
	out<<'[';
	for(T x:a)out<<x<<',';
	return out<<']';
}
template<class T>
vector<T> ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<class T>
void debug(T x){
	cerr<<x<<endl;
}
template<class T,class...S>
void debug(T x,S...y){
	cerr<<x<<' ',debug(y...);
}
#else
#define debug(...) void()
#endif
const int N=120,mod=998244353;
int n,k,m;
char a[N];
namespace Solve1{
	const int K=22,M=1<<K;
	int f[2][M],cnt[M];
	void add(int &x,int y){
		(x+=y)>=mod&&(x-=mod);
	}
	void solve(){
		int S=0,now=1,las=0,U=(1<<k-1)-1;
		for(int S=0;S<=U*2;S++)cnt[S]=__builtin_popcount(S);
		for(int i=1;i<=m;i++){
			S|=(a[i]&1)<<(i+k-m-1);
		}
		f[now][S]=1;
		for(int i=m+1;i<=n;i++){
			swap(now,las);
			memset(f[now],0,sizeof f[now]);
			for(int S=0;S<=U;S++)if(f[las][S]){
				for(int x:{0,1}){
					int T=(S|(x<<k-1))>>1;
					if(i<k||cnt[S|(x<<k-1)]!=k/2)add(f[now][T],f[las][S]);
				}
			}
		}
		cout<<accumulate(f[now],f[now]+1+U,0ll)%mod<<endl;
		debug(1.0*clock()/CLOCKS_PER_SEC);
		exit(0);
	}
}
const int M=6;
using matrix=array<array<int,M>,M>;
#ifdef DEBUG
ostream& operator << (ostream &out,matrix a){
	vector<vector<int>>p;
	for(auto x:a){
		vector<int>t;
		for(int y:x)t.push_back(y);
		p.push_back(t);
	}
	return out<<p;
}
#endif
namespace Solve2{
	int ans,lim,sx,sy,tx,ty,H;
	int ban[N][N],f[N][N][N],g[N][N];
	int det(matrix &a,int m){
		int ans=1;
		for(int i=0;i<=m;i++){
			for(int j=i+1;j<=m;j++){
				for(;a[i][i];a[i].swap(a[j]),ans=-ans){
					int x=mod-a[j][i]/a[i][i];
					for(int k=0;k<=m;k++)a[j][k]=(a[j][k]+1ll*x*a[i][k])%mod;
				}
				a[i].swap(a[j]),ans=-ans;
			}
		}
		for(int i=0;i<=m;i++)ans=1ll*ans*a[i][i]%mod;
		return (ans+mod)%mod;
	}
	int cnt,s[M];
	void dfs(int x){
		if(x==n/k+1){
			static matrix a;
			for(int i=0;i<=n/k;i++){
				for(int j=0;j<=n/k;j++){
					if(i&&j<n/k){
						a[i][j]=f[lim*(i+1)-s[i]][lim*(j+1)-s[j+1]][k];
					}else if(i){
						a[i][j]=f[lim*(i+1)-s[i]][tx][ty];
					}else if(j<n/k){
						a[i][j]=g[lim*(j+1)-s[j+1]][k];
					}else{
						a[i][j]=g[tx][ty];
					}
				}
			}
			int res=det(a,n/k);
			// if(res)debug(cnt,ary(s,0,x-1),a,res);
			(ans+=res)%=mod;
			return;
		}
		for(s[x]=s[x-1];s[x]<s[x-1]+lim&&s[x]<=cnt;s[x]++)dfs(x+1);
	}
	void calc(){
		lim=k/2,sx=lim,sy=0;
		for(int i=0;i<m;i++){
			ban[sx][sy++]=1,sx-=a[i+1]&1;
			if(sx<0)return;
		}
		ban[sx][sy]=1;
		H=lim*(n/k+1);
		for(int i=H;i>=0;i--){
			for(int j=k;j>=0;j--){
				ban[i][j]|=ban[i+1][j]|ban[i][j+1];
			}
		}
		for(int i=0;i<=H;i++)debug(ary(ban[i],0,k));
		for(cnt=0;cnt<=n/k*lim+min(lim,n%k);cnt++){
			tx=lim*(n/k+1)-cnt,ty=n%k;
			if(cnt==15)debug(tx,ty,"ok");
			if(ban[tx][ty])continue;
			for(int i=tx;i<=H;i++){
				for(int j=ty;j<=k;j++)ban[i][j]=i>tx||j>ty;
			}
			memset(g,0,sizeof g);
			memset(f,0,sizeof f);
			g[sx][sy]=1;
			for(int i=sx;~i;i--){
				for(int j=sy+1;j<=k;j++)if(!ban[i][j]){
					g[i][j]=(g[i+1][j-1]+g[i][j-1])%mod;
				}
			}
			for(int s=0;s<=H;s++){
				f[s][s][0]=1;
				for(int i=s;~i;i--){
					for(int j=1;j<=k;j++)if(!ban[i][j]){
						f[s][i][j]=(f[s][i+1][j-1]+f[s][i][j-1])%mod;
					}
				}
			}
			// debug(tx,ty);
			dfs(1);
			for(int i=tx;i<=H;i++){
				for(int j=ty;j<=k;j++)ban[i][j]=0;
			}
		}
	}
	void solve(){
		calc();
		debug("rev");
		for(int i=1;i<=m;i++)a[i]^=1;
		memset(ban,0,sizeof ban);
		calc();
		cout<<ans<<endl;
		debug(1.0*clock()/CLOCKS_PER_SEC);
		exit(0);
	}
}
int main(){
	scanf("%d%d%d%s",&n,&k,&m,a+1);
	if(k<=Solve1::K)Solve1::solve();
	Solve2::solve();
	return 0;
}