#include using namespace std; typedef long long ll; typedef pair p_ll; template void debug(T itr1, T itr2) { auto now = itr1; while(now=0; i--) const ll MOD = pow(10,9)+7; const ll LLINF = pow(2,61)-1; const int INF = pow(2,30)-1; vector fac; void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; } ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; } ll nck(ll n, ll k) { return n> N >> M >> K; c_fac(); ll result = 0; for (ll i=1; N+M-i*2>=K&&i<=M; i++) result = ( result + (nck(N,i)*nck(M-1,i-1)%MOD) ) % MOD; result = result * (fac[N-1]*fac[M]%MOD) % MOD; cout << result << endl; return 0; }