N,M,K=map(int,input().split())
dp=[[0]*(2**N) for _ in range(M)]
dp[0]=[1]*(2**N)
p=998244353
for i in range(M-1):
    for j in range(2**N):
        for k in range(2**N):
            if (k&j).bit_count()>=K:
                dp[i+1][k]+=dp[i][j]
                dp[i+1][k]%=p
ans=0
for d in dp[-1]:
    ans+=d
    ans%=p
print(ans)