import sys
input = sys.stdin.readline
N, M, K = map(int, input().split())
X = list(map(int, list(input())[: -1]))
mod = 998244353

class Factorial:
  def __init__(self, n, mod):
    self.mod = mod
    self.f = [1]
    for i in range(1, n + 1): self.f.append(self.f[-1] * i % mod)
    self.i = [pow(self.f[-1], mod - 2, mod)]
    for i in range(1, n + 1)[: : -1]: self.i.append(self.i[-1] * i % mod)
    self.i.reverse()
  def factorial(self, i): return self.f[i]
  def ifactorial(self, i): return self.i[i]
  def combi(self, n, k): return self.f[n] * self.i[n - k] % self.mod * self.i[k] % self.mod
  def permi(self, n, k): return self.f[n] * self.i[n - k] % self.mod

f = Factorial(N, mod)

dp = [0] * (N - K + 1)

dp[-1] = 1
for i in range(M):
  x = X[i]
  for j in range(N - K + 1):
    if x:
      t = 0
      for k in range(1, K + 1):
        t += f.combi(K + j, j + k)
        t %= mod
        #print(i, j, k, (K + j, j + k), t)
      dp[j] *= t * pow(2, N - j - K, mod)
      dp[j] %= mod
    else:
      for k in range(j):
        dp[k] += dp[j] * f.combi(K + j, j - k) * pow(2, N - j - K, mod)
        dp[k] %= mod
      dp[j] *= pow(2, N - j - K, mod)
      dp[j] %= mod
print(sum(dp) % mod)