#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod  = 998244353;
ll n,m,k;
ll fac[200005];
ll ans = 0;
ll qpow(ll x,ll n){
	ll res = 1;
	while(n>0){
		if(n&1) res=res*x%mod;
		x=x*x%mod;
		n>>=1;
	}
	return res;
}
ll C(int n,int m){
	return fac[n]%mod*qpow(fac[m],mod-2)%mod*qpow(fac[n-m],mod-2)%mod;
}
int main(){
	cin>>n>>m>>k;
	for(ll i=0;i<n+2;i++) fac[i] = 1;
	for(ll i=1;i<n+2;i++) fac[i] = i*fac[i-1]%mod;
	for(ll i=0;i<=k;i++){
		ans = ans + m*C(n-1,i)%mod*qpow(m-1,n-1-i)%mod;
	}
	cout<<(ans+mod)%mod<<endl;
	return 0;
}