def cmb(n, r, mod):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod

mod = 998244353
N = 2*10**5
g1 = [1]*(N+1)
g2 = [1]*(N+1)
inverse = [1]*(N+1)

for i in range( 2, N + 1 ):
    g1[i]=( ( g1[i-1] * i ) % mod )
    inverse[i]=( ( -inverse[mod % i] * (mod//i) ) % mod )
    g2[i]=( (g2[i-1] * inverse[i]) % mod )
inverse[0]=0

pow_2 = [1 for i in range(N)]
for i in range(1,N):
    pow_2[i] = 2 * pow_2[i-1] % mod


import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd,log

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

N,M,K = mi()
X = input()
dp = [[0 for j in range(N+1)] for bit in range(M+1)]
dp[M][N] = 1
for bit in range(M-1,-1,-1):
    if X[M-1-bit]=="0":
        #bit目が立っているのアがrest-K個以下
        for rest in range(N+1):
            for k in range(rest-K+1):
                dp[bit][rest-k] += dp[bit+1][rest] * cmb(rest,k,mod) * pow_2[k*bit]
                dp[bit][rest-k] %= mod
    else:
        #bit目が立っているのがrest-K+1個以上
        for rest in range(N+1):
            for k in range(rest-K+1,rest+1):
                dp[bit][rest] += dp[bit+1][rest] * cmb(rest,k,mod)
                dp[bit][rest] %= mod

print(sum(dp[0])%mod)