#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000

int beki(int a,int b,int M = modulo){
	int x = 1;
	while(b!=0){
		if(b&1){
			x=((long long)x*a)%M;
		}
		a=((long long)a*a)%M;
		b>>=1;
	}
	return x;
}


int gyakugen(int a){
	return beki(a,modulo-2);
}

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

int main(){
	
	int N,M,K;
	cin>>N>>M>>K;
	
	combi C(1000000);
	
	int ans = 0;
	
	for(int i=1;true;i++){
		if(N+M-i*2<K)break;
		if(N<i||M<i)break;
		int t = mod(C.junretsu(N-i,i-1)*C.junretsu(M-i,i-1));
		t = mod(t * C.combination(N,i));
		t = mod(t * C.kaijou[i]);
		t = mod(t * C.kaijou[N-i]);
		
		t = mod(t * C.combination(M,i));
		t = mod(t * C.kaijou[i]);
		t = mod(t * gyakugen(i));
		t = mod(t * C.kaijou[M-i]);
		
		ans = mod(ans + t);
	}
	
	cout<<ans<<endl;
	
	
	return 0;
}