#include<iostream>
#include<atcoder/modint>
using namespace std;
#include<vector>
template<typename T>
struct combination{
	vector<T>fac,invfac;
	combination(size_t N=0):fac(1,1),invfac(1,1)
	{
		make_table(N);
	}
	void make_table(size_t N)
	{
		if(fac.size()>N)return;
		size_t now=fac.size();
		N=max(N,now*2);
		fac.resize(N+1);
		invfac.resize(N+1);
		for(size_t i=now;i<=N;i++)fac[i]=fac[i-1]*i;
		invfac[N]=1/fac[N];
		for(size_t i=N;i-->now;)invfac[i]=invfac[i+1]*(i+1);
	}
	T factorial(size_t n)
	{
		make_table(n);
		return fac[n];
	}
	T P(size_t n,size_t k)
	{
		if(n<k)return 0;
		make_table(n);
		return fac[n]*invfac[n-k];
	}
	T C(size_t n,size_t k)
	{
		if(n<k)return 0;
		make_table(n);
		return fac[n]*invfac[n-k]*invfac[k];
	}
	T H(size_t n,size_t k)
	{
		if(n==0)return k==0?1:0;
		return C(n-1+k,k);
	}
};
using mint=atcoder::modint998244353;
combination<mint>C;
int N,M,K;
main()
{
	cin>>N>>M>>K;
	mint all=C.C(N,K-2)*C.P(M,K-2);
	mint n=K-2;
	mint coef=0;
	coef+=(N-n)*(N-n-1)/2*n/3;
	coef+=(N-n)*n*(n-1)/2;
	coef+=(N-n)*(N-n-1)/2*n*(n-1)/2/4*2;
	coef+=n*(N-n)*(n-1)/2;
	coef+=n*(N-n)*(n-1)*(n-2)/2;

	coef+=(M-n)*(M-n-1)/2*n/3;
	coef+=(M-n)*n*(n-1)/2;
	coef+=(M-n)*(M-n-1)/2*n*(n-1)/2/4*2;
	coef+=n*(M-n)*(n-1)/2;
	coef+=n*(M-n)*(n-1)*(n-2)/2;
	
	coef+=n*(N-n)*(n-1)*(M-n)/4;
	coef+=n*(n-1)/2/2;
	coef+=(n*n-n)*(n*n-n-1)/2-n*(n-1)/2;

	cout<<(all*coef).val()<<endl;
}