MOD = 998244353
N,M,K = map(int,input().split())
if M==1:
    ans = pow(2,N,MOD)
else:
    dp = [[0 for _ in range((1<<N))] for _ in range(M+1)]
    for s in range(1<<N):
        for t in range(1<<N):
            if bin(s&t).count("1")<K:continue
            dp[2][s] += 1
    for m in range(3,M+1):
        for s in range(1<<N):
            cnt = bin(s).count("1")
            if cnt<K:continue
            for t in range(1<<N):
                if bin(s&t).count("1")<K:continue
                dp[m][s] = (dp[m][s]+dp[m-1][t])%MOD
    ans = 0
    for s in range(1<<N):
        cnt = bin(s).count("1")
        if cnt<K:continue
        ans = (ans+dp[M][s])%MOD
print(ans)