#include #define rep(i,n) for(int i=0;i<(n);i++) using namespace std; class mint{ static const int MOD=1e9+7; int x; public: mint():x(0){} mint(long long y){ x=y%MOD; if(x<0) x+=MOD; } mint& operator+=(const mint& m){ x+=m.x; if(x>=MOD) x-=MOD; return *this; } mint& operator-=(const mint& m){ x-=m.x; if(x< 0) x+=MOD; return *this; } mint& operator*=(const mint& m){ x=1LL*x*m.x%MOD; return *this; } mint& operator/=(const mint& m){ return *this*=inverse(m); } mint operator+(const mint& m)const{ return mint(*this)+=m; } mint operator-(const mint& m)const{ return mint(*this)-=m; } mint operator*(const mint& m)const{ return mint(*this)*=m; } mint operator/(const mint& m)const{ return mint(*this)/=m; } mint operator-()const{ return mint(-x); } friend mint inverse(const mint& m){ int a=m.x,b=MOD,u=1,v=0; while(b>0){ int t=a/b; a-=t*b; swap(a,b); u-=t*v; swap(u,v); } return u; } friend istream& operator>>(istream& is,mint& m){ long long t; is>>t; m=mint(t); return is; } friend ostream& operator<<(ostream& os,const mint& m){ return os< memo={1}; if(memo.size()<=n){ int k=memo.size(); memo.resize(n+1); for(;k<=n;k++) memo[k]=memo[k-1]*k; } return memo[n]; } mint fact_inverse(int n){ static vector memo={1}; if(memo.size()<=n){ int k=memo.size(); memo.resize(n+1); memo[n]=inverse(fact(n)); for(int i=n;i>k;i--) memo[i-1]=memo[i]*i; } return memo[n]; } mint choose(int n,int k,int type=0){ if(k==0) return 1; if(n< k) return 0; if(type==0){ return fact(n)*fact_inverse(k)*fact_inverse(n-k); } else{ if(k>n-k) k=n-k; mint res=fact_inverse(k); rep(i,k) res*=n-i; return res; } } mint multichoose(int n,int k,int type=0){ return choose(n+k-1,k,type); } int main(){ int n,m,k; cin>>n>>m>>k; mint ans=0; for(int L=1;L<=min(n,m);L++) if(n+m-2*L>=k) { ans+=choose(n,L)*multichoose(L,m-L); } ans*=fact(n-1)*fact(m); cout<