#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << (x) << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
using ll = long long;
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<unsigned int mod_>
struct ModInt{
	using uint = unsigned int;
	using ll = long long;
	using ull = unsigned long long;

	constexpr static uint mod = mod_;

	uint v;
	ModInt():v(0){}
	ModInt(ll v):v(normS(v%mod+mod)){}
	explicit operator bool() const {return v!=0;}
	static uint normS(const uint &x){return (x<mod)?x:x-mod;}		// [0 , 2*mod-1] -> [0 , mod-1]
	static ModInt make(const uint &x){ModInt m; m.v=x; return m;}
	ModInt operator+(const ModInt& b) const { return make(normS(v+b.v));}
	ModInt operator-(const ModInt& b) const { return make(normS(v+mod-b.v));}
	ModInt operator-() const { return make(normS(mod-v)); }
	ModInt operator*(const ModInt& b) const { return make((ull)v*b.v%mod);}
	ModInt operator/(const ModInt& b) const { return *this*b.inv();}
	ModInt& operator+=(const ModInt& b){ return *this=*this+b;}
	ModInt& operator-=(const ModInt& b){ return *this=*this-b;}
	ModInt& operator*=(const ModInt& b){ return *this=*this*b;}
	ModInt& operator/=(const ModInt& b){ return *this=*this/b;}
	ll extgcd(ll a,ll b,ll &x,ll &y) const{
		ll u[]={a,1,0},v[]={b,0,1};
		while(*v){
			ll t=*u/ *v;
			rep(i,3) swap(u[i]-=t*v[i],v[i]);
		}
		if(u[0]<0) rep(i,3) u[i]=-u[i];
		x=u[1],y=u[2];
		return u[0];
	}
	ModInt inv() const{
		ll x,y;
		extgcd(v,mod,x,y);
		return make(normS(x+mod));
	}
	bool operator==(const ModInt& b) const { return v==b.v;}
	bool operator!=(const ModInt& b) const { return v!=b.v;}
	friend istream& operator>>(istream &o,ModInt& x){
		ll tmp;
		o>>tmp;
		x=ModInt(tmp);
		return o;
	}
	friend ostream& operator<<(ostream &o,const ModInt& x){ return o<<x.v;}
};
using mint = ModInt<1000000007>;
V<mint> fact,ifact;
mint Choose(int x,int y){
	return fact[x]*ifact[y]*ifact[x-y];
}
void init(){
	const int N = 20000100;
	fact.resize(N);
	ifact.resize(N);
	fact[0] = 1;
	rep1(i,N-1) fact[i] = fact[i-1]*i;
	ifact[N-1] = fact[N-1].inv();
	for(int i=N-2;i>=0;i--) ifact[i] = ifact[i+1] * (i+1);
}
V<mint> getf(int H,int W){
	V<mint> f(H+W+1,fact[H+W]);
	rep(t,H+W+1) f[t] *= ifact[t]*ifact[H+W-t];
	return f;
}
int main(){
	init();
	int H,W,K;
	cin>>H>>W>>K;
// 	cout<<"table"<<endl;
// 	VV<mint> ways(H+1,V<mint>(W+1));
// 	rep(A,H+1){
// 		rep(B,W+1){
// 			int t = A+B;
// //			if(t==0 || t>K) continue;
// 			mint way = Choose(H,A)*Choose(W,B);//*fact[t];// * fact[H+W-t]*ifact[H+W-K];
// 			cout<<way<<" ";
// 			ways[A][B] = way;
// //			ans += way * (A+1)*(B+1);
// //			ans += way;
// 		}
// 		cout<<endl;
// 	}

	// V<mint> fHW(H+W+1),ans(H+W+1);
	// rep(A,H+1) rep(B,W+1){
	// 	fHW[A+B] += ways[A][B];
	// 	ans[A+B] += ways[A][B]*(A+1)*(B+1);
	// }
	V<mint> ans2(H+W+1);
	{
		auto f = getf(H,W);
		auto fA = getf(H-1,W);	//*H
		auto fB = getf(H,W-1);
		auto fC = getf(H-1,W-1);
		rep(t,H+W+1) ans2[t] = f[t] + (t-1>=0?fA[t-1]*H:0) + (t-1>=0?fB[t-1]*W:0) + (t-2>=0?fC[t-2]*H*W:0);
	}
	// show(fHW);
	// show(getf(H,W));
	// show(fact[H+W]);
	// show(ans);
	// show(ans2);
	mint ANS = 0;
	rep1(t,K) ANS += ans2[t] * fact[t] * fact[H+W-t] * ifact[H+W-K];
	cout<<ANS<<endl;
}

Measured memory_bytes: 547072