#include<bits/stdc++.h>
using namespace std;

const int N = 1e6 + 5;
typedef long long LL;

int n, m, k;
LL ans, fac[N], inv[N], mod = 998244353;

LL fps(LL a, LL b) {
	LL res = 1;
	while(b) {
		if(b&1) res = (res*a)%mod;
		b /= 2;
		a = a*a%mod;
	}
	return res;
}

LL calc(int k) {
	LL res = fac[n - 1]*inv[k]%mod*inv[n - k - 1]%mod;
	res = res*m%mod*fps(m - 1, n - k - 1)%mod;
	return res;
}

int main() {
	cin>>n>>m>>k;
	fac[0] = fac[1] = inv[1] = inv[0] = 1;
	for(int i = 1; i <= n; i++) {
		fac[i] = fac[i - 1]*i%mod;
		inv[i] = fps(fac[i], mod - 2);
	}
	if(m == 1) {
		if(k == n - 1) cout<<1<<endl;
		else cout<<0<<endl;
		return 0;
	}
	for(int i = 0; i <= k; i++) 
		ans = (ans + calc(i))%mod;
	cout<<ans<<endl;
	return 0;
}