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

S = [[0] * (N + 1) for i in range(N + 1)]
for i in range(1, N + 1):
    S[i][1] = 1
    for j in range(2, i + 1):
        S[i][j] = (S[i - 1][j - 1] + S[i - 1][j] * j) % mod
fac = [1] * (N + 1)
for i in range(1, N + 1):
    fac[i] = fac[i - 1] * i % mod


dp = [[0] * (N + 1) for i in range(M + 2)]
val = 1
for i in range(M + 1, K + 1):
    val *= i
    val %= mod
dp[M + 1][0] = val
for i in range(M, 0, -1):
    ndp = [[0] + dp[j][:N] for j in range(M + 2)]
    for j in range(i + 1, M + 2):
        for k in range(N + 1):
            ndp[i][k] += dp[j][k]
            ndp[i][k] %= mod
    if i <= K:
        for j in range(i, M + 2):
            for k in range(N + 1):
                ndp[j][k] *= j
                ndp[j][k] %= mod
    dp = ndp

ans = 0
for s in range(1, N + 1):
    for i in range(1, M + 2):
        ans += dp[i][s] * S[N][s] % mod * fac[s]
        ans %= mod

print(ans)