#include<bits/stdc++.h>
#define mod 998244353
#define en 499122177
using namespace std;
int di[500005],id[500005];
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 C(int n,int m){
	if(n<0||m<0||n<m)return 0;
	return 1ll*di[n]*id[m]%mod*id[n-m]%mod;
}
int a[1<<21],ap[1<<21];
int b[1<<21],bp[1<<21];
int rev[1<<21];
void ntt(int l,int *c,int *d,int gs){
	for(int i=0;i<(1<<l);++i)d[rev[i]]=c[i];
	for(int i=1;i<(1<<l);i<<=1){
		int o1=powdv(3,(mod-1)/i/2);
		if(gs==-1)o1=powdv(o1);
		for(int j=0;j<(1<<l);j+=i+i){
			int o=1;
			for(int k=j;k<j+i;++k){
				int A=d[k],B=d[k+i];
				d[k]=(A+1ll*o*B)%mod,d[k+i]=(A-1ll*o*B)%mod;
				o=1ll*o*o1%mod;
			}
		}
	}
	if(gs==-1){
		int cj=1;
		for(int i=1;i<=l;++i)cj=1ll*cj*en%mod;
		for(int i=0;i<(1<<l);++i)d[i]=1ll*d[i]*cj%mod;
	}
}
int sc[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;
	for(int i=0;i<=k;++i)a[i]=1ll*(i%2==0?1:-1)*id[i]*id[k-i]%mod;
	for(int i=0;i<=N-k;++i)b[i]=1ll*id[i]*id[N-k-i]%mod;
	int cd=N+1;
	while(cd&(cd-1))++cd;
	int l=__builtin_ctz(cd);
	for(int i=0;i<(1<<l);++i){
		for(int j=0;j<l;++j)if(i&(1<<j))rev[i]^=1<<(l-j-1);
	}
	ntt(l,a,ap,1);
	ntt(l,b,bp,1);
	for(int i=0;i<(1<<l);++i)ap[i]=1ll*ap[i]*bp[i]%mod;
	ntt(l,ap,a,-1);
	for(int i=0;i<=N;++i)sc[i]=1ll*a[i]*di[i]%mod*di[N-i]%mod;
	int ans=0;
	for(int s=0;s<=n;++s)for(int t=0;t<=m;++t){
		int xs=1ll*((s+t)%2==0?1:-1)*C(n,s)*C(m,t)%mod;
		int gs=s*m+t*n-2*s*t;
		ans=(ans+1ll*xs*sc[gs])%mod;
	}
	for(int i=1;i<=n+m;++i)ans=1ll*ans*en%mod;
	ans=(ans+mod)%mod;
	printf("%d\n",ans);
	return 0;
}