N,M,K = map(int,input().split())
MOD = 998244353

if M==1:
    exit(print(1<<N))

def popcnt(n):
    c = (n & 0x5555555555555555) + ((n >> 1) & 0x5555555555555555)
    c = (c & 0x3333333333333333) + ((c >> 2) & 0x3333333333333333)
    c = (c & 0x0f0f0f0f0f0f0f0f) + ((c >> 4) & 0x0f0f0f0f0f0f0f0f)
    c = (c & 0x00ff00ff00ff00ff) + ((c >> 8) & 0x00ff00ff00ff00ff)
    c = (c & 0x0000ffff0000ffff) + ((c >> 16) & 0x0000ffff0000ffff)
    c = (c & 0x00000000ffffffff) + ((c >> 32) & 0x00000000ffffffff)
    return c

dp = [0] * (1<<N)
for s in range(1<<N):
    if popcnt(s) < K: continue
    dp[s] = 1

for _ in range(M-1):
    ndp = [0] * (1<<N)
    for s in range(1<<N):
        if popcnt(s) < K: continue
        for t in range(1<<N):
            if popcnt(s&t) < K: continue
            ndp[t] = (ndp[t] + dp[s]) % MOD
    dp = ndp
print(sum(dp) % MOD)