#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5+10,mod=998244353;
int n,m,k,ans,pre[N],inv[N];
int qpow(int a,int b){
	int t=1;
	while(b){
		if(b&1)t=t*a%mod;
		b/=2,a=a*a%mod;
	}
	return t;
}
void init(int n){
	for(int i=1;i<=n;i++)pre[i]=pre[i-1]*i%mod;
	inv[n]=qpow(pre[n],mod-2);for(int i=n-1;i>=1;i--)inv[i]=inv[i+1]*(i+1)%mod;
}
int C(int n,int m){return n<0||m<0||n<m?0:pre[n]*inv[m]%mod*inv[n-m]%mod;}
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>m>>k,pre[0]=inv[0]=1,init(m);
	for(int j=0,op=1;j<=k;j++,op*=-1)ans=(ans+op*C(k,j)*qpow(m+k-j,n)%mod+mod)%mod;
	ans=ans*C(m,k)%mod;
	cout<<ans<<"\n";
	return 0;
}