#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define int long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n,m;
int k;

modint cd(int n,int m){
	modint res=1; initC(m+1);
	Rep(i,m,1)res*=(n-i+1);
	return res*ifac[m];
}

modint f[5][5][2],sf[5][5];

signed main()
{
	For(i,0,4)f[i][0][0]=f[0][i][1]=1,sf[i][0]=sf[0][i]=1;
	
	For(i,1,3)
		For(j,1,3){
			For(i1,0,i-1)
				For(j1,0,j)
					f[i][j][0]+=f[i1][j1][1]*sf[i-i1-1][j-j1]*C(j,j1);
			For(i1,0,i)
				For(j1,0,j-1)
					f[i][j][1]+=f[i1][j1][0]*sf[i-i1][j-j1-1]*C(i,i1);
			sf[i][j]=f[i][j][0]+f[i][j][1];
		//	cout<<i<<' '<<j<<" "<<sf[i][j].x<<endl;
		}
	
	sf[2][2]+=2;
		n=read(),m=read(),k=read();
		if(k==1)cout<<1<<'\n';
		if(k==2)cout<<(n-1+m-1)%mod<<'\n';
		if(k==3){
			modint res=0;
			res+=cd(n-1,2)+cd(m-1,2)+((n-1)*(m-1)%mod*4%mod);
			cout<<res.x<<'\n';
		}
		if(k==4){
			modint res=0;
			res+=cd(n-1,3)+cd(m-1,3);
			res+=(n-1)*cd(m-1,2)*(3+4+4);
			res+=(m-1)*cd(n-1,2)*(3+4+4);
			res+=(n-1)*(m-1)%mod;
			cout<<res.x<<"\n";
		}
		if(k==5){
			modint res=0;
			res+=cd(n-1,4);
			res+=cd(m-1,4);
	//		cout<<"res: "<<res.x<<endl;
			res+=(m-1)*cd(n-1,3)*sf[1][3];
			res+=(n-1)*cd(m-1,3)*sf[1][3];
			res+=cd(n-1,2)*cd(m-1,2)*sf[2][2];
	//		cout<<"f13 "<<(((m-1)*cd(n-1,3))+(n-1)*cd(m-1,3)).x<<endl;
	//		cout<<"f22 "<<(cd(n-1,2)*cd(m-1,2)).x<<endl;
			res+=cd(n-1,2)*(m-1)*7;
			res+=cd(m-1,2)*(n-1)*7;
	//		cout<<"ftmp "<<((cd(n-1,2)*(m-1))+cd(m-1,2)*(n-1)).x<<endl;
			cout<<res.x<<'\n';
		}
	return 0;
}