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

dp = [[0] * (1 << N) for _ in range(M+1)]
dp[0] = [1] * (1 << N)

for i in range(M-1):
    for a in range(1 << N):
        for b in range(1 << N):
            x = (a & b).bit_count()
            if x >= K:
                dp[i+1][b] += dp[i][a]
                dp[i+1][b] %= MOD

ans = 0
for i in range(1 << N):
    ans += dp[M-1][i]
    ans %= MOD

print(ans)