const input = require("fs").readFileSync("/dev/stdin", "utf8")

function pow (x ,n) {
    let res = 1n
    while (n > 0) {
        if (n & 1n) res = res * x % mod
        x = x * x % mod
        n >>= 1n
    }
    return res
}

function fact (n) {
    let res = 1n
    for (n; n > 1; n--) {
        res = res * n
    }
    return res
}

function fact2 (n, m) {
    let res = 1n
    for (n; n <= m; n++) {
        res = res * n
    }
    return res
}

const mod = 998244353n

;(input => {
    const lines = input.split('\n')
    let [N, M, K] = lines[0].split(' ').map(Number)
    N = BigInt(N)
    M = BigInt(M)
    K = BigInt(K)

    let ans = 0n
    for (let k = 0n; k <= K; k++) {
        let left = fact2(N - k, N - 1n) / fact(k)
        ans += left * pow((M - 1n), (N - (k + 1n))) * M % mod
    }

    console.log((ans % mod).toString())
 
})(input)
