#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=200010,mod = 998244353;
int n,k,m;
ll p[N];
ll ksm(ll a,ll b)
{
	ll res=1;
	while(b)
	{
		if(b&1) res=res*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return res;
}
ll c(int a,int b)
{
	return p[a]*ksm(p[a-b],mod-2)%mod*ksm(p[b],mod-2)%mod;
}
int main()
{
	
	cin>>n>>m>>k;
	
	p[0]=1;
	for(int i=1;i<=n;i++) p[i]=p[i-1]*i%mod;
	ll ans=0;
	for(int i=0;i<=k;i++)
		ans=(ans+m*c(n-1,i)%mod*ksm(m-1,n-i-1)%mod)%mod;
	cout<<ans;
	return 0;
}
