MOD = 998244353

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

if M == 1:
    print(2**N)
    exit()

dp = [[0]*(1<<N) for _ in range(M)]
dp[0] = [1 if bin(i)[2:].count('1') >= K else 0 for i in range(1<<N)]

for i in range(1, M):
    for pre_bit in range(1<<N):
        for next_bit in range(1<<N):
            if bin(pre_bit & next_bit)[2:].count('1') >= K:
                dp[i][next_bit] += dp[i-1][pre_bit]
                dp[i][next_bit] %= MOD

for d in dp:
    print(*d)

print(sum(dp[-1]) % MOD)