#include<bits/stdc++.h>
using namespace std;
const int N=1<<19,P=998244353;
int n,m,t,k,fac[N],inv[N],f[N],w[N],A[N],B[N],lim,ans;
int ksm(int x,int y){
	int res=1;
	for(;y;y>>=1,x=1ll*x*x%P)if(y&1)res=1ll*res*x%P;
	return res;
}
void up(int n){
	lim=1;
	while(lim<=n)lim<<=1;
}
int C(int n,int m){
	return 1ll*fac[n]*inv[m]%P*inv[n-m]%P;
}
void init(){
	fac[0]=inv[0]=fac[1]=inv[1]=1;
	for(int i=2;i<N;++i)fac[i]=1ll*fac[i-1]*i%P,inv[i]=1ll*(P-P/i)*inv[P%i]%P;
	for(int i=2;i<N;++i)inv[i]=1ll*inv[i-1]*inv[i]%P;
	for(int mid=1,j,o;mid<N;mid<<=1)
		for(w[j=mid]=1,o=ksm(3,(P-1)/(mid<<1)),++j;j<mid<<1;++j)w[j]=1ll*w[j-1]*o%P;
	t=n*m,up(t);
}
inline int md(int x){
	return x>=P?x-P:x;
}
void DFT(int *A){
	for(int mid=lim>>1,j,k,*W,*a,*b,Y,R;mid;mid>>=1)
		for(j=0,R=mid<<1;j<lim;j+=R)
		 	for(k=0,W=w+mid,a=A+j,b=a+mid;k<mid;++k,++W,++a,++b)
				*b=1ll*md(*a+P-(Y=*b))**W%P,*a=md(*a+Y);
}
void IDFT(int *A){
	for(int mid=1,j,k,*W,*a,*b,Y,R;mid<lim;mid<<=1)
		for(j=0,R=mid<<1;j<lim;j+=R)
			for(k=0,W=w+mid,a=A+j,b=a+mid;k<mid;++k,++W,++a,++b)
				Y=1ll**b**W%P,*b=md(*a+P-Y),*a=md(*a+Y);
	reverse(A+1,A+lim);
	for(int in=ksm(lim,P-2),i=0;i<lim;++i)A[i]=1ll*A[i]*in%P;
}
int main(){
	scanf("%d%d%d",&n,&m,&k);
	init();
	for(int i=0;i<=k;++i)A[i]=md(1ll*(i&1?-1:1)*inv[i]*inv[k-i]%P+P);
	for(int i=0;i<=t-k;++i)B[i]=1ll*inv[i]*inv[t-k-i]%P;
	DFT(A),DFT(B);
	for(int i=0;i<lim;++i)A[i]=1ll*A[i]*B[i]%P;
	IDFT(A);
	for(int i=0;i<=t;++i)f[i]=1ll*A[i]*fac[i]%P*fac[t-i]%P;
	for(int i=0;i<=n;++i)for(int j=0;j<=m;++j)
		ans=(ans+1ll*(i+j&1?-1:1)*C(n,i)*C(m,j)%P*f[i*(m-j)+j*(n-i)])%P;
	ans=1ll*ans*ksm(P+1>>1,n+m)%P;
	printf("%d\n",md(ans+P));
	return 0;
}