#include <bits/stdc++.h>
using namespace std;

constexpr int mod = 998244353;

long long fac[200005], finv[200005], inv[200005];

void COMinit() {
    fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
    for (int i = 2; i < 200005; i++) {
        fac[i] = fac[i - 1] * i % mod;
        inv[i] = mod - inv[mod % i] * (mod / i) % mod;
        finv[i] = finv[i - 1] * inv[i] % mod;
    }
}

long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}

long long modpow(long long a,long long b) {
    long long ans = 1;
    while(b) {
        if(b & 1) {
            (ans *= a) %= mod;
        }
        (a *= a) %= mod;
        b /= 2;
    }
    return ans;
}

long long dp[201][201];

long long calc(int N,int M,int K,string X) {
    for(int i = 0; i <= M; i++) {
        for(int j = 0; j <= N; j++) {
            dp[i][j] = 0;
        }
    }
    dp[0][0] = 1;
    for(int i = 0; i < M; i++) {
        for(int j = 0; j <= N; j++) {
            for(int k = 0; k <= N; k++) {
                if(X[i] == '0') {
                    if(j+k <= N) {
                        dp[i+1][j+k] += dp[i][j]*COM(N-j,k)%mod*modpow(2,j)%mod;
                        dp[i+1][j+k] %= mod;
                    }
                }
                else {
                    if(j <= N-K) {
                        if(N-j-K < k) {
                            dp[i+1][j] += dp[i][j]*COM(N-j,k)%mod*modpow(2,j)%mod;
                            dp[i+1][j] %= mod;
                        }
                    }
                    else {
                        dp[i+1][j] += dp[i][j]*COM(N,k)%mod;
                        dp[i+1][j] %= mod;
                    }
                }
            }
        }
    }
    long long sum = 0;
    for(int i = 0; i <= N; i++) {
        sum += dp[M][i];
        sum %= mod;
    }
    return sum;
}


int main() {
    int N,M,K;
    string X;
    cin >> N >> M >> K >> X;
    COMinit();
    long long ans = calc(N,M,K,X);
    int idx = -1;
    for(int i = 0; i < M; i++) {
        if(X[i] == '0') {
            idx = i;
        }
    }
    if(idx == -1) {
        cout << ans << endl;
    }
    else {
        X[idx] = '1';
        for(int i = idx+1; i < M; i++) {
            X[i] = '0';
        }
        cout << (ans+mod-calc(N,M,K,X))%mod << endl;
    }
}