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

MOD=998244353
dp=[[0 for _ in range(1<<N)] for _ in range(M)]
for i in range(1<<N):dp[0][i]=1

def popcount(x):
    ret=0
    for i in range(5):
        if x>>i&1==1:ret+=1
    return ret

for i in range(1,M):
    for j in range(1<<N):
        for k in range(1<<N):
            x=j&k
            if popcount(x)>=K:
                dp[i][j]+=dp[i-1][k]
                dp[i][j]%=MOD

ans=0            
for i in range(1<<N):
    ans+=dp[M-1][i]
    ans%=MOD
print(ans)