#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

constexpr int FACT_SIZE = 1000000;
mint Fact[FACT_SIZE + 1];
mint iFact[FACT_SIZE + 1];
const auto fact_init = [] {
    Fact[0] = mint::raw(1);
    for(int i = 1; i <= FACT_SIZE; ++i) {
        Fact[i] = Fact[i-1] * i;
    }
    iFact[FACT_SIZE] = Fact[FACT_SIZE].inv();
    for(int i = FACT_SIZE; i; --i) {
        iFact[i-1] = iFact[i] * i;
    }
    return false;
}();

mint comb(int n, int k) {
    if (k == 0) return mint::raw(1);
    assert(n >= 0 && k >= 0);
    if (k > n) return mint::raw(0);
    return Fact[n] * iFact[n - k] * iFact[k];
}

mint icomb(int n, int k) {
    return iFact[n] * Fact[n - k] * Fact[k];
}

mint fact(int n) {return Fact[n];}
mint perm(int n, int k) {
    assert(0 <= n);
    return Fact[n] * iFact[n - k];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, k;
    cin >> n >> m >> k;
    string s;
    cin >> s;
    vector<mint> dp(n + 1);
    dp[n] = 1;
    vector<mint> f(n + 1);
    for(int j = k; j <= n; j++) {
        mint s;
        for(int r = 0; r < k; r++) s += comb(j, r);
        f[j] = s;
    }
    rep(i, m) {
        if (s[i] == '1') {
            for(int j = k; j <= n; j++) {
                dp[j] *= f[j];
            }
        } else {
            vector<mint> ndp(n + 1);
            for(int j = k; j <= n; j++) {
                for(int nj = k; nj <= j; nj++) {
                    int cnt = j - nj;
                    ndp[nj] += dp[j] * comb(j, cnt) * mint(2).pow(cnt * (m - i - 1));
                }
            }
            dp = move(ndp);
        }
    }
    mint ans = accumulate(all(dp), mint());
    cout << ans.val() << endl;
}