import std;

const MOD = 998244353;

const N = 2 * 10^^5 + 10;
long[N] fact;
long[N] invfact;

void initFact() {
    fact[0] = fact[1] = 1;
    foreach (i; 2..N)
        fact[i] = fact[i-1] * i % MOD;

    invfact[N-1] = modPow(fact[N-1], MOD-2, MOD);
    foreach_reverse (i; 0..N-1)
        invfact[i] = invfact[i+1] * (i+1) % MOD;
}

long nck(long n, long k) {
    long x = fact[n] * invfact[k] % MOD;
    return x * invfact[n-k] % MOD;
}

long calc(int n, int m, int k) {
    initFact();

    long ans = 0;
    foreach (i; 0..k+1) {
        auto x = m * modPow(m-1, n-i-1, MOD) % MOD;
        x = x * nck(n-1, i) % MOD;
        ans = (ans + x) % MOD;
    }
    return ans;
}

void main() {
    int n, m, k; scan(n, m, k);
    writeln(calc(n, m, k));
}

void scan(T...)(ref T a) {
    string[] ss = readln.split;
    foreach (i, t; T) a[i] = ss[i].to!t;
}
T read(T=string)() { return readln.chomp.to!T; }
T[] reads(T)() { return readln.split.to!(T[]); }
alias readints = reads!int;

long modPow(long x, long k, long m) {
    if (k == 0) return 1;
    if (k % 2 == 0) return modPow(x * x % m, k / 2, m);
    return x * modPow(x, k - 1, m) % m;
}
