import std;

const MOD = 998244353;
const N = 2 * 10^^5;

long calc(int n, int m, int k) {
    auto binom = new Binom(N);

    long ans = 0;
    foreach (i; 0..k+1) {
        ans += (m * modpow(m-1, n-i-1) % MOD) * binom(n-1, i) % MOD;
        ans %= 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) {
    if (k == 0) return 1;
    if (k % 2 == 0) return modpow(x * x % MOD, k / 2);
    return x * modpow(x, k - 1) % MOD;
}

class Binom {
    private long[] _fact;
    private long[] _invfact;

    this(size_t size) {
        _fact = new long[size + 10];
        _invfact = new long[size + 10];
        init();
    }

    private void init() {
        auto n = _fact.length;
        _fact[0] = 1;
        foreach (i; 1..n)
            _fact[i] = _fact[i-1] * i % MOD;
        _invfact[n-1] = modpow(_fact[n-1], MOD-2);
        foreach_reverse (i; 0..n-1)
            _invfact[i] = _invfact[i+1] * (i+1) % MOD;
    }

    long get(int n, int k) const {
        return (_fact[n] * _invfact[k] % MOD) * _invfact[n-k] % MOD;
    }

    long opCall(int n, int k) const {
        return (_fact[n] * _invfact[k] % MOD) * _invfact[n-k] % MOD;
    }
}
