#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll inf=1e9+7;
const ll mod=1e9+7;
//Combination
long long extGCD(long long a,long long mod,long long &x,long long &y){
    if(mod==0){
        x=1;
        y=0;
        return a;
    }
    long long d=extGCD(mod,a%mod,y,x);
    y-=(a/mod)*x;
    return d;
}
long long invmod(long long a,long long mod){
    long long x,y;
    extGCD(a,mod,x,y);
    x%=mod;
    if(x<0)x+=mod;
    return x;
}
ll fac[2000010],finv[2000010],inv[2000010];
void combinit(){
    fac[0]=fac[1]=1;
    finv[0]=finv[1]=1;
    inv[1]=1;
    REP(i,2,2000010){
        fac[i]=fac[i-1]*i%mod;
        inv[i]=invmod(i,mod);
        finv[i]=finv[i-1]*inv[i]%mod;
    }
}
ll comb(ll n,ll k){
    if(n<k)return 0;
    if(n<0||k<0)return 0;
    return fac[n]*(finv[k]*finv[n-k]%mod)%mod;
}
ll rui(ll a,ll b){
    ll res=1;
    ll x=a;
    while(b){
        if(b&1)res=res*x%mod;
        x=x*x%mod;
        b/=2;
    }
    return res;
}
signed main(){
    ll n,m,k;cin>>n>>m>>k;
    combinit();
    ll d=n+m;
    vector<ll>kai(d+1);
    kai[0]=1;
    REP(i,1,d+1){
        kai[i]=kai[i-1]*i%mod;
    }
    ll ans=0;
    rep(i,n+m+1){
        if(i%2)continue;
        if(n+m-i<k)continue;
        ll res=1;
        ll c=(i)/2;
        if(c>m)continue;
        res=res*comb(n,c)%mod;
        res=res*comb(m-1,c-1)%mod;
        res=res*kai[n-1]%mod;
        res=res*kai[m]%mod;
        ans=(ans+res)%mod;
    }
    if(ans<0)ans+=mod;
    cout<<ans<<endl;
}