#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define in freopen("in.txt","r",stdin)
//#define out freopen("out.txt","w",stdout) 

const ll mod=998244353;
ll njie[200005];

ll qupow(ll a,ll b)
{
	if(b==0) return 1;
	ll c=qupow(a,b/2);
	if(b%2==1) return c*c%mod*a%mod;
	else return c*c%mod;
}

ll cnm(ll n,ll m)
{
	ll ans=njie[n]%mod;
	ll b=njie[n-m]*njie[m]%mod;
	return ans*qupow(b,mod-2)%mod;
}

int main()
{
	ll i,j;
	ll n,m,k;
	scanf("%lld%lld%lld",&n,&m,&k);
	njie[0]=1;
	for(i=1;i<=n;i++) njie[i]=njie[i-1]*i%mod;
	ll sum=0;
	for(i=0;i<=k;i++)
	{
		sum+=cnm(n-1,n-1-i)*m%mod*qupow(m-1,n-1-i)%mod;
	}
	sum%=mod;
	printf("%lld\n",sum);
	return 0;
}