from math import comb

MOD = 998244353
N,M,K = map(int,input().split())
X = [[0] * (N+1) for _ in range(N+1)]

for i in range(N+1):
    for j in range(N+1):
        if i < K or j < K:
            continue
        if i + j - N >= K:
            X[i][j] = comb(N,j)
        elif i == K:
            X[i][j] = comb(N-i,j-K)
        elif j == K:
            X[i][j] = comb(i,K)
        else:
            if N - i >= j:
                X[i][j] = comb(N,j) - comb(N-i,j)
            else:
                X[i][j] = comb(N,j) - comb(i,j - K)

dp = [[0] * (N+1) for _ in range(M)]
for i in range(N+1):
    dp[0][i] = comb(N,i)
for i in range(M-1):
    for j in range(N+1):
        for k in range(N+1):
            dp[i+1][k] += dp[i][j] * X[j][k]
            dp[i+1][k] %= MOD
ans = sum(dp[-1])
ans %= MOD
print(ans)