#include <cstdio>
#include <algorithm>
#define mod 998244353
#define maxn 200010
#define LL long long
using namespace std;
LL fact[maxn],inv[maxn],ans,t[maxn],p;
int n,m,k,nm;
LL quick_pow(LL a,LL b){//a^b
	LL ans=1;
	while(b){
		if(b&1)ans=ans*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return ans%mod;
}
void init(){
	int i;
	scanf("%d%d%d",&n,&m,&k);
	nm=n,nm=max(nm,m),fact[0]=1;
	for(i=1;i<=nm;i++)fact[i]=fact[i-1]*i%mod;//fact[i]代表i!
	inv[nm]=quick_pow(fact[nm],mod-2);
	for(i=nm-1;i>=0;i--)inv[i]=inv[i+1]*(i+1)%mod;//inv[i]代表i!的乘法逆元
}
LL C(LL a,LL b){//组合数计算
	return fact[a]*inv[a-b]%mod*inv[b]%mod;
}
int main(){
	int i;
	init();
	ans=0,p=quick_pow(m-1,n-k-1);
	for(i=n-k;i<=n;i++){
		ans=(ans+m*p%mod*C(n-1,i-1)%mod)%mod;//C(n-1,i-1)隔板法
		p=p*(m-1)%mod;
	}
	printf("%lld\n",ans);
	return 0;
}
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;

#define ff first
#define ss second
#define pb push_back
#define sz size()
#define mp make_pair
#ifndef ONLINE_JUDGE 
#include "/home/asif/Codes/Library/debug.h"
#endif
/*--------------------------------------------------------------------*/

const int N = 2e5 + 5;
const int MOD = 998244353;

namespace nCr {
  ll factorial[N], invFactorial[N];
  ll ncr(ll n, ll r){
    return (( (factorial[n] * invFactorial[r]) % MOD) * invFactorial[n - r]) % MOD;
  }
  void init(){
    invFactorial[1] = 1;
    for(int i = 2;i < N;i++)invFactorial[i] = MOD - (MOD / i) * invFactorial[MOD % i] % MOD;
    factorial[0] = factorial[1] = invFactorial[0] = 1;
    for(int i = 2; i < N; i++){
      factorial[i] = (factorial[i - 1] * i) % MOD;
      invFactorial[i] = (invFactorial[i - 1] * invFactorial[i]) % MOD;
    }
  }
}

ll bigmod(ll a, ll p){
  if(p == 0) return 1LL;
  ll ret = bigmod(a, p / 2);
  ret *= ret;
  ret %= MOD;
  if(p & 1) ret = (ret * a) % MOD;
  return ret;

}

int main() {

  ll n, m, k;
  cin >> n >> m >> k; 

  nCr::init();

  ll ans = 0LL;
  for(int i = 0; i <= k; i++){
    ans += (((nCr::ncr(n - 1, i) * bigmod(m - 1, n - i - 1)) % MOD) * m) % MOD;
    ans %= MOD;
  }
  cout << ans << endl;

  return 0;
}