import sys
input = lambda : sys.stdin.readline().rstrip()

write = lambda x: sys.stdout.write(x+"\n")
debug = lambda x: sys.stderr.write(x+"\n")
writef = lambda x: print("{:.12f}".format(x))
# sys.setrecursionlimit(3*10**5+10)

n,m,k = list(map(int, input().split()))
x = list(map(int, input()))
M = 998244353
N = 10**4 # 必要なテーブルサイズ
g1 = [0] * (N+1) # 元テーブル
g2 = [0] * (N+1) #逆元テーブル
inverse = [0] * (N+1) #逆元テーブル計算用テーブル
g1[0] = g1[1] = g2[0] = g2[1] = 1
inverse[0], inverse[1] = [0, 1] 
for i in range( 2, N + 1 ):
    g1[i] = ( g1[i-1] * i ) % M 
    inverse[i] = ( -inverse[M % i] * (M//i) ) % M # ai+b==0 mod M <=> i==-b*a^(-1) <=> i^(-1)==-b^(-1)*aより
    g2[i] = (g2[i-1] * inverse[i]) % M 
def cmb(n, r, M=M):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return ((g1[n] * g2[r] % M) * g2[n-r]) % M
def perm(n, r, M=M):
    if (r<0 or r>n):
        return 0
    return (g1[n] * g2[n-r]) % M
v2 = [1]
for _ in range(1000):
    v2.append(v2[-1]*2%M)
dp = [0]*(n+1) # 候補がi個
dp[n] = 1
for i in range(m):
    ndp = [0]*(n+1)
    if x[i]==0:
        for j in range(n+1):
            val = dp[j]
            if val==0:
                continue
            for nj in range(k, j+1):
                ndp[nj] += val * (cmb(j, nj) * v2[n-j] % M) % M
                ndp[nj] %= M
    else:
        for j in range(n+1):
            val = dp[j]
            if val==0:
                continue
            tmp = 0
            for v in range(k):
                tmp += cmb(j, v)
                tmp %= M
            ndp[j] += val * (v2[n-j] * tmp % M) % M
    dp = ndp
ans = sum(dp)%M
print(ans%M)