MOD=998244353

n,m,k=map(int,input().split())
dp=[[0]*(1<<n) for _ in range(m+1)]
dp[0]=[1]*(1<<n)
for i in range(m):
    for bit in range(1<<n):
        for nbit in range(1<<n):
            if bin(bit&nbit).count('1')>=k:
                dp[i+1][nbit]+=dp[i][bit]
                dp[i+1][nbit]%=MOD

print(dp[m][(1<<n)-1]%MOD)