#include <iostream>
#include <cstdio>
#define N 200005
using namespace std;
typedef long long ll;

ll n, m, k, ans, M=998244353;
ll fac[N]={1,1}, inv[N]={1,1}, fiv[N]={1,1};
ll C(ll p, ll q) {return fac[p] * fiv[q] % M * fiv[p-q] % M;}
ll pow(ll p, ll q) {return q ? pow(p*p%M, q/2) * (q&1 ? p : 1) % M : 1;}

int main() {
	ll i, t;
	cin >> n >> m >> k;
	for(i=2; i<=n; i++) fac[i] = fac[i-1] * i % M;
	for(i=2; i<=n; i++) inv[i] = inv[M%i] * (M-M/i) % M;
	for(i=2; i<=n; i++) fiv[i] = fiv[i-1] * inv[i] % M;
	for(i=0; i<=k; i++) {
		t = m * C(n-1, i) % M * pow(m-1, n-1-i) % M;
		(ans += t) %= M;
	}
	cout << ans;
	return 0;
}