#include <iostream>
#include <algorithm>
typedef long long ll;
using namespace std;

ll mod=998244353;
const int SIZE=2010000;
ll fac[SIZE], finv[SIZE], inv[SIZE], sum[260000];
void COMinit(ll m){
    fac[0]=fac[1]=1;
    finv[0]=finv[1]=1;
    inv[1]=1;
    for(int i=2; i<SIZE; ++i){
        fac[i]=(fac[i-1]*i)%m;
        inv[i]=m-(inv[m%i]*(m/i))%m;
        finv[i]=(finv[i-1]*inv[i])%m;
    }
}
ll COM(int n, int k, ll m){
    if(n<k) return 0;
    if(n<0 || k<0) return 0;
    return (fac[n]*((finv[k]*finv[n-k])%m))%m;
}

int main(void){
    int N, M;
    cin >> N >> M;
    COMinit(mod);
    ll ans=0;
    sum[0]=0;
    for(int i=0; i*2<=M; ++i){
        sum[i+1]=(sum[i]+COM(N-2+i, i, mod))%mod;
    }
    for(int i=M%2; i<=min(N, M); i += 2){
        ll num=COM((3*M-i)/2+N-1, N-1, mod);
        (num += mod-(sum[max((3*M-i)/2-M, 0)]*(N-i))%mod) %= mod;
        (num += mod-(sum[max((3*M-i)/2-M+1, 0)]*i)%mod) %= mod;
        (num *= COM(N, i, mod)) %= mod;
        (ans += num) %= mod;
    }
    cout << ans << endl;
    return 0;
}

#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;
}