#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001

struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};

combi C(1000000);

int main(){
	
	int H,W,K;
	cin>>H>>W>>K;
	
	int M = min(H,W);
	vector<mint> p(M+2,0);
	for(int i=1;i<=M;i++){
		p[i] = C.combination(H,i) * C.combination(W,i);
		p[i] *= C.kaijou[i];
		
	}
	//cout<<p[2].val()<<endl;
	p[M+1] = 1;
	mint cur=  1;
	for(int i=1;i<=M;i++){
		cur *= H*W + 1 - i;
		//cout<<cur.val()<<','<<p[i].val()<<endl;
		p[i] /= cur;
		p[i] = 1-p[i];
	}
	
	cur = 0 ;
	for(int i=1;i<=M+1;i++){
		p[i] -= cur;
		cur += p[i];
	}
	
	mint ans = 0;
	mint tt = 1;
	rep(i,K){
		tt /= H*W+K-i;
	}
	
	rep(i,p.size()){
		mint ttt = tt;
		ttt *= i;
		ttt *= C.kaijou[i+K-1];
		ttt *= C.kaijou_[i];
		ttt *= p[i];
		ans += ttt;
	}
	
	cout<<ans.val()<<endl;
	
	return 0;
}