import sys
input = sys.stdin.readline

mod=998244353

N,M,K=map(int,input().split())

DP=[1]*(1<<N)

for i in range(M-1):
    NDP=[0]*(1<<N)

    for j in range(1<<N):
        for k in range(1<<N):

            count=0

            for l in range(N):
                if (j & (1<<l) != 0) and (k & (1<<l) != 0):
                    count+=1

            if count>=K:
                NDP[k]=(NDP[k]+DP[j])%mod

    DP=NDP

print(sum(DP)%mod)