#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#define ll long long int
#define mod 998244353


ll sum=0;


ll ruijo(ll a,ll n){ 
  if(n==0) return 1;
  if(n%2==0){
    ll tmp=ruijo(a,n/2);
    tmp*=tmp;
    return tmp%mod;}
  else{
    ll tmp=a*ruijo(a,n-1)%mod;
    return tmp;}
}

int main(){

  ll n,m,k;
  scanf("%lld%lld%lld",&n,&m,&k);
  ll tmp=1;
  sum += m*ruijo(m-1,n-1)%mod;
  for(ll i=1;i<=k;i++){
    tmp = tmp*(n-i)%mod*ruijo(i,mod-2)%mod; //combination
    //printf("%lld\n",tmp);
    sum += tmp*m%mod*ruijo(m-1,n-1-i)%mod;
    sum %= mod;}

  printf("%lld\n",sum);
  
  return 0;
}
