import typing
import sys
input = lambda: sys.stdin.readline().strip()
inf = 10**18
mod = 998244353

# numpyのオーバーフローが原因だった
# 行列積
def matmul2d(A, B, mod):
  assert len(A[0]) == len(B)
  n = len(A)
  l = len(A[0])
  m = len(B[0])
  C = [[0 for _ in range(m)] for _ in range(n)]
  for i in range(n):
    for j in range(m):
      for k in range(l):
        C[i][j] += A[i][k]*B[k][j]
        C[i][j] %= mod
  return C

def solve():
  N, M, K = map(int, input().split())
  # 遷移行列
  A = [[0 for _ in range(1 << N)] for _ in range(1 << N)]
  for i in range(1 << N):
    for j in range(1 << N):
      if (i&j).bit_count() >= K:
        A[i][j] = 1

  As = [A]
  for _ in range(18):
    As.append(matmul2d(As[-1], As[-1], mod))
  Ans = [[1 if i==j else 0 for j in range(1 << N)] for i in range(1 << N)]

  i = 0
  M-=1
  while M:
    if M % 2 == 1:
      Ans = matmul2d(Ans, As[i], mod)
    M //= 2
    i += 1

  print(sum(sum(a) for a in Ans)%mod)
  
def main():
  t = 1
  for _ in range(t):
    solve()
main()