MOD = 998244353
n, m, k = map(int, input().split())

dp = [[0] * (1 << n) for _ in range(m)]
dp[0] = [1] * (1 << n)
for i in range(m - 1):
	for j in range(1 << n):
		for jj in range(1 << n):
			if bin(j & jj).count('1') >= k:
				dp[i + 1][jj] += dp[i][j]
				dp[i + 1][jj] %= MOD

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