import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
sys.setrecursionlimit(10**7)
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################

p = 998244353
N = 10 ** 3  # N は必要分だけ用意する
fact = [1, 1]  # fact[n] = (n! mod p)
factinv = [1, 1]  # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1]  # factinv 計算用
 
for i in range(2, N + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p)
def cmb(n, r):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return ((fact[n] * factinv[r])%p) * factinv[n-r] % p
 
def pem(n,r):
    if (r < 0) or (n < r):
        return 0
    return (fact[n] * factinv[r])%p

n,m,k = na()
x = [int(i) for i in list(input())]
c = []
for i in range(n+1):
    c.append(0)
    for j in range(k):
        c[i] += cmb(i,j)
        c[i] %= p
#print(c)
    
    

dp = [0]*(n+1)
dp[-1] = 1
for i in range(m):
    op = [0]*(n+1)
    dp,op = op,dp
    if x[i]:
        for j in range(n+1):
            dp[j] += op[j]*c[j]*pow(2,n-j,p)
            dp[j] %= p
    else:
        for j in range(n+1):
            for nj in range(j+1):
                if nj<k:
                    continue
                dp[nj] += op[j] * pow(2,n-j,p)*cmb(j,nj)
                dp[nj] %= p
print(sum(dp)%p)