#include<iostream>
using namespace std;
typedef long long int ll;
const ll mod = 998244353; // prime 
ll n, m, k, c[200005]; 

ll quickpower(ll x, ll y, ll z) {//pow(x,y)%z
	ll ans = 1, base = x;
	while (y) {
		if (y & 1) 	ans = base * ans % mod;
		base = base * base % mod;
		y >>= 1;
	}
	return ans;
}
int main()
{
	cin >> n >> m >> k;
	c[0] = 1;ll ans = 0;
	for(int i = 1; i < n; ++i) {
		c[i] = c[i - 1] * (n - i) % mod * quickpower(i, mod - 2, mod) % mod;
	}
	for (int i = 0; i <= k; ++i) {
		ans = (ans + m * (quickpower(m - 1, n - i - 1, mod)) % mod * c[n - i - 1] % mod) % mod;
	}
	cout << ans << endl;
}