import sys

# sys.setrecursionlimit(1000005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 63)
# md = 10**9+7
md = 998244353

def nCr(com_n, com_r):
    if com_r < 0: return 0
    if com_n < com_r: return 0
    return fac[com_n]*ifac[com_r]%md*ifac[com_n-com_r]%md

n_max = 1000
fac = [1]
for i in range(1, n_max+1): fac.append(fac[-1]*i%md)
ifac = [1]*(n_max+1)
ifac[n_max] = pow(fac[n_max], md-2, md)
for i in range(n_max-1, 1, -1): ifac[i] = ifac[i+1]*(i+1)%md

lim = 201
acc = [[0]*(lim+5) for _ in range(lim+5)]
for n in range(1, lim):
    for r in range(n+1):
        acc[n][r+1] = (acc[n][r]+nCr(n, r))%md
pw = [1]*lim
for i in range(lim-1): pw[i+1] = pw[i]*2%md

n, m, K = LI()
xx =list(map(int,SI()))

dp = [0]*(n+1)
dp[n] = 1
for x in xx:
    pre, dp = dp, [0]*(n+1)
    if x:
        for i in range(K, n+1):
            dp[i] = pre[i]*acc[i][K]%md*pw[n-i]%md
    else:
        for i in range(K, n+1):
            for j in range(K, i+1):
                dp[j] += pre[i]*nCr(i, j)%md*pw[n-i]%md
                dp[j] %= md

ans = 0
for d in dp:
    ans += d
    ans %= md

print(ans)