n,m,k=map(int,input().split())
M=998244353
q=[1]*(1<<n)
for _ in range(1,m):
  nq=[0]*(1<<n)
  for i in range(1<<n):
    for j in range(1<<n):
      c=(i&j).bit_count()
      if c>=k:
        nq[j]+=q[i]
        nq[j]%=M
  q=nq
print(sum(q)%M)