#include<bits/stdc++.h>
#define mod 998244353
using namespace std;
int powdv(int x,int y=mod-2){
	int ans=1;
	while(y){
		if(y&1)ans=1ll*ans*x%mod;
		y>>=1,x=1ll*x*x%mod;
	}
	return ans;
}
int di[500005],id[500005];
inline int C(int n,int m){
	return 1ll*di[n]*id[m]%mod*id[n-m]%mod;
}
inline int CC(int n,int m){
	return 1ll*di[m]*di[n-m]%mod;
}
int A[500005],B[500005],an[500005];
int main(){
	int n,m,k;
	scanf("%d%d%d",&n,&m,&k);
	int N=n*m;
	di[0]=1;
	for(int i=1;i<=N;++i)di[i]=1ll*i*di[i-1]%mod;
	id[N]=powdv(di[N]);
	for(int i=N-1;i>=0;--i)id[i]=1ll*id[i+1]*(i+1)%mod;
	an[0]=1;an[1]=(N-2*k+mod)%mod;
	for(int n=1;n<N;++n){
		an[n+1]=(1ll*an[1]*an[n]+(n-N-1ll+mod)*an[n-1])%mod*di[n]%mod*id[n+1]%mod;
	}
	int C2=1ll*id[k]*id[N-k]%mod;
	for(int i=0;i<=N;++i)an[i]=1ll*CC(N,i)*an[i]%mod;
	for(int a=0;a<=n;++a)A[a]=a%2?mod-C(n,a):C(n,a);
	for(int b=0;b<=m;++b)B[b]=b%2?mod-C(m,b):C(m,b);
	int he=0;
	for(int a=0;a<=n;++a)for(int b=0;b<=m;++b){
		he=(he+1ll*A[a]*B[b]%mod*an[a*(m-b)+b*(n-a)])%mod;
	}
	int ans=1ll*he*C2%mod*powdv((mod+1)/2,n+m)%mod;
	printf("%d\n",ans);
	return 0;
}