#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


Mint det(vector<vector<Mint>> a) {
  const int n = a.size();
  Mint ret = 1;
  for (int h = 0; h < n; ++h) {
    for (int i = h; i < n; ++i) if (a[i][h]) {
      if (h != i) {
        swap(a[h], a[i]);
        ret = -ret;
      }
      break;
    }
    ret *= a[h][h];
    if (!ret) break;
    const Mint s = a[h][h].inv();
    for (int j = h + 1; j < n; ++j) a[h][j] *= s;
    for (int i = h + 1; i < n; ++i) {
      const Mint t = a[i][h];
      if (t) for (int j = h + 1; j < n; ++j) a[i][j] -= t * a[h][j];
    }
  }
  return ret;
}


int N, K, M;
char S[120];


namespace small_k {
Mint run() {
  vector<char> ban(1 << K, 0);
  for (int p = 0; p < 1 << K; ++p) {
    ban[p] = (2 * __builtin_popcount(p) == K);
  }
  vector<Mint> crt(1 << (K-1), 0), nxt(1 << K, 0);
  crt[0] = 1;
  for (int i = 0; i < N; ++i) {
    fill(nxt.begin(), nxt.end(), 0);
    for (int p = 0; p < 1 << (K-1); ++p) {
      for (int a = 0; a < 2; ++a) if (i >= M || S[i] - '0' == a) {
        nxt[p << 1 | a] += crt[p];
      }
    }
    if (i + 1 >= K) {
      for (int p = 0; p < 1 << K; ++p) if (ban[p]) {
        nxt[p] = 0;
      }
    }
    for (int p = 0; p < 1 << (K-1); ++p) {
      crt[p] = nxt[p] + nxt[p | 1 << (K-1)];
    }
  }
  Mint ans = 0;
  for (int p = 0; p < 1 << (K-1); ++p) {
    ans += crt[p];
  }
  return ans;
}
}  // small_k


/*
  assume 1: always fewer
  s[i]: # of 1's in [0, i)
  s[i + 1] - s[i] \in [0, 1]
  s[i + K] - s[i] \in [0, K/2)
  path j: from (0, s[j K] - j (K/2)) to (K, s[(j+1) K] - j (K/2))
*/
namespace large_k {
int J, Y0, Y1;
vector<int> SX, SY, TX, TY;
bool ban[120][120];

template <class T> void doDP(int sx, int sy, T ret) {
  sy -= Y0;
  if (ban[sx][sy]) return;
  ret[sx][sy] = 1;
  for (int x = sx; x < K; ++x) for (int y = 0; y <= Y1 - Y0; ++y) if (ret[x][y]) {
    if (!ban[x + 1][y    ]) ret[x + 1][y    ] += ret[x][y];
    if (!ban[x + 1][y + 1]) ret[x + 1][y + 1] += ret[x][y];
  }
}

Mint dp0[120][120];
Mint dp[120][120][120];

Mint solve() {
  {
    const int dx = TX[J - 1] - SX[J - 1];
    const int dy = TY[J - 1] - SY[J - 1];
    if (!(0 <= dy && dy <= dx)) {
      return 0;
    }
  }
  vector<vector<Mint>> a(J, vector<Mint>(J));
  for (int j1 = 0; j1 < J; ++j1) {
    a[0][j1] = dp0[TX[j1]][TY[j1] - Y0];
  }
  for (int j0 = 1; j0 < J; ++j0) for (int j1 = 0; j1 < J; ++j1) {
    a[j0][j1] = dp[SY[j0] - Y0][TX[j1]][TY[j1] - Y0];
  }
  const Mint res = det(a);
// cerr<<COLOR("32")<<"[solve]"<<COLOR()<<endl;
// cerr<<"SX = "<<SX<<", TX = "<<TX<<endl;
// cerr<<"SY = "<<SY<<", TY = "<<TY<<endl;
// cerr<<"a = "<<a<<endl;
// cerr<<"res = "<<res<<endl;
  return res;
}

// s: s[j - 1]
Mint dfs(int j, int s) {
  if (j == J) {
    return solve();
  } else {
    Mint ret = 0;
    for (int ss = s; ss < s + K/2; ++ss) {
      TY[j - 1] = ss - (j - 1) * (K/2);
      SY[j] = ss - j * (K/2);
      ret += dfs(j + 1, ss);
    }
    return ret;
  }
}

Mint run() {
  J = (N + K - 1) / K;
  Y0 = -(J - 1) * (K/2);
  Y1 = K/2;
cerr<<"J = "<<J<<", Y0 = "<<Y0<<", Y1 = "<<Y1<<endl;
  // Y1 - Y0 <= J (K/2) < (N/K + 1) (K/2) < N/2 + K/2 < N
  assert(Y1 - Y0 <= N);
  SX.assign(J, 0);
  SY.assign(J, 1001001001);
  TX.assign(J, K);
  TY.assign(J, 1001001001);
  SX[0] = M;
  TX[J - 1] = N - (J - 1) * K;
  Mint ans = 0;
  for (int few = 0; few < 2; ++few) {
// cerr<<COLOR("93")<<"few = "<<few<<COLOR()<<endl;
    SY[0] = count(S, S + M, '0' + few);
    for (int &ty = TY[J - 1] = Y0; ty <= -(J - 1) + min(TX[J - 1], K/2 - 1); ++ty) {
// cerr<<"  ty = "<<ty<<endl;
      // ban to ensure non-intersecting <=> id perm
      memset(ban, 0, sizeof(ban));
      for (int y = SY[0] + 1; y <= Y1; ++y) ban[SX[0]][y - Y0] = true;
      for (int y = Y0; y < TY[J - 1]; ++y) ban[TX[J - 1]][y - Y0] = true;
      {
        int y = 0;
        for (int x = 0; x < M; ++x) {
          ban[x][y - Y0] = true;
          if (S[x] - '0' == few) ++y;
        }
      }
// cerr<<"    SX = "<<SX<<", TX = "<<TX<<endl;
// cerr<<"    SY = "<<SY<<", TY = "<<TY<<endl;
// cerr<<"    ban = "<<endl;for(int x=0;x<=K;++x){cerr<<"    ";pv(ban[x],ban[x]+(Y1-Y0+1));}
      memset(dp0, 0, sizeof(dp0));
      memset(dp, 0, sizeof(dp));
      doDP(SX[0], SY[0], dp0);
      for (int y = Y0; y <= Y1; ++y) {
        doDP(0, y, dp[y - Y0]);
      }
      ans += dfs(1, 0);
    }
  }
  return ans;
}
}  // large_k


int main() {
  for (; ~scanf("%d%d%d", &N, &K, &M); ) {
    if (M) {
      scanf("%s", S);
    } else {
      S[0] = 0;
    }
cerr<<COLOR("33")<<"N = "<<N<<", K = "<<K<<", M = "<<M<<", S = "<<S<<COLOR()<<endl;
    
    Mint ans = 0;
    if (K <= 20) {
      ans = small_k::run();
    } else {
      ans = large_k::run();
    }
    printf("%u\n", ans.x);
#ifdef LOCAL
const Mint brt=small_k::run();
if(brt!=ans)cerr<<N<<" "<<K<<" "<<M<<" "<<S<<": "<<brt<<" "<<ans<<endl;
assert(brt==ans);
#endif
  }
  return 0;
}