function pow (n ,m) {
    if (m === 0) {
        return 1
    }
    let pow = n
    for (let i = 2; i <= m; i++) {
        pow = (n * pow) % mod
    }
    return pow
}

const mod = 998244353

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

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

    let ans = pow((M - 1), (N - 1)) * M
    for (let k = 1; k <= K; k++) {
        ans += (N - k) * pow((M - 1), (N - (k + 1))) * M
    }

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