#MMA Contest 018 F

N, M, K = map(int, input().split())
MOD = 998244353
assert 1 <= K <= N <= 5 and 1 <= M <= 2 * 10 ** 4

#遷移先を前計算
sub = [[] for _ in range(1 << N)]
has_bit = lambda S, x: S >> x & 1
L = [S for S in range(1 << N) if S.bit_count() >= K]
for S in L:
    for T in L:
        if sum(has_bit(S, i) & has_bit(T, i) for i in range(N)) >= K:
            sub[S].append(T)

#DP[i][S]: i列目を決める直前であって、点灯状況がS
DP = [[0] * (1 << N) for _ in range(M + 1)]
DP[0][-1] = 1
for i in range(M):
    for S in L:
        for T in sub[S]:
            DP[i + 1][T] += DP[i][S]
            DP[i + 1][T] %= MOD
print(sum(DP[-1]) % MOD)