import typing
import sys
# sys.setrecursionlimit(100100)
from collections import defaultdict
input = lambda: sys.stdin.readline().strip()
inf = 10**18
mod = 998244353
import numpy as np
# import heapq

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 = [np.array(A)]
  for _ in range(15):
    As.append(As[-1]@As[-1])
    As[-1]%=mod
    
  i = 0
  if M == 1:
    print(0)
    return

  dp = sum(As[0]).reshape((-1, 1))
  Ans = np.identity(1<<N, dtype=int)
  M-=2
  while M:
    if M % 2 == 1:
      Ans = Ans@As[i]
      Ans%=mod
    M //= 2
    i += 1
    
  Ans = Ans@dp
  ans = sum(Ans)[0]%mod
  print(ans)
def main():
  t = 1
  for _ in range(t):
    solve()
main()