MOD = 998244353


def solve(N: int, M: int, K: int) -> int:
    dp = [[0 for _ in range(N + 1)] for _ in range(K + 1)]
    M_inv = pow(M, MOD - 2, MOD)
    dp[0][0] = 1
    for i in range(K):
        for j in range(N + 1):
            if j == N:
                dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % MOD
                continue
            for k in range(1, M + 1):
                nj = j + k
                if nj > N:
                    nj = N - (nj - N)
                dp[i + 1][nj] = (dp[i + 1][nj] + dp[i][j] * M_inv) % MOD
    return dp[K][N]


n, m, k = map(int, input().split())
print(solve(n, m, k))
