#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <deque>
#include <math.h>
using namespace std;

typedef long long ll;

constexpr ll mod=1e9+7;

ll mod_pow(ll a,ll b){
    a%=mod;
    if(b==0)return 1;
    if(b==1)return a;
    ll res=mod_pow(a,b/2)%mod;
    res*=res; res%=mod;
    if(b%2)res*=a;
    return res%mod;
}

struct perm{
private:
    int sz;
    vector<ll> p,invp;
public:
    perm(int n){
        sz=n+1;
        p.resize(sz),invp.resize(sz);
        p[0]=1;
        for(int i=1;i<=sz-1;i++){
            p[i]=p[i-1]*i%mod;
        }
        invp[sz-1]=mod_pow(p[sz-1],mod-2);
        for(int i=sz-2;i>=0;i--){
            invp[i]=invp[i+1]*(i+1)%mod;
        }
    }
    ll comb(ll x,ll y){
        if(x<y||y<0)return 0;
        return (p[x]*invp[x-y]%mod)*invp[y]%mod;
    }
};
perm p(500500);


int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m,k; cin >> n >> m >> k;
    ll res=0;
    ll pp=1;
    for(ll i=1;i<=n-1;i++){
        (pp*=i)%=mod;
    }
    for(int i=1;i<=n;i++){
        if(n-i+m-i<k)continue;
        if(i>m)continue;
        ll add=pp;
        (add*=p.comb(m-i+i-1,i-1))%=mod;
        (add*=p.comb(n,i))%=mod;
        (res+=add)%=mod;
    }
    for(ll i=1;i<=m;i++){
        (res*=i)%=mod;
    }
    printf("%lld\n",res);
}