md = 998244353

def solve(n, m, k):
  cnt = [1] * (1 << n)
  for _ in range(m - 1):
    nxt_cnt = [0] * (1 << n)
    for i in range(1 << n):
      for j in range(1 << n):
        if bin(i & j).count("1") >= k:
          nxt_cnt[j] += cnt[i]
    for i in range(1 << n):
      nxt_cnt[i] %= md
    cnt = nxt_cnt
  return sum(cnt) % md

def solve1(n, k):
  ans = 0
  for i in range(1 << n):
    if bin(i).count("1") >= k:
      ans += 1
  return ans

n, m, k = [int(x) for x in input().split()]

# if m == 1:
#   print(solve1(n, k))
# else:
#   print(solve(n, m, k))

print(solve(n, m, k))