#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=998244353;

ll power(ll x,ll n){
    if(n==0) return 1;
    ll res=power(x*x%mod,n/2);
    if(n&1) res=res*x%mod;
    return res;
}

int main(){
  int n,m,k;
  cin>>n>>m>>k;
  ll a[n+1];
  a[0]=1;
  rep(i,1,n+1) a[i]=a[i-1]*i%mod;
  ll b[n+1];
  b[0]=1;
  rep(i,1,n+1) b[i]=power(a[i],998244351);
  ll ans=0;
  rep(i,0,k+1){
    ans+=(a[n-1]*b[i]%mod*b[n-1-i]%mod)*m%mod*power(m-1,n-1-i)%mod;
    ans%=mod;
  }
  cout<<ans<<endl;
}