n,m,k = map(int,input().split())
mod = 10**9+7

N = n+m+5
fact = [1]*N
finv = [1]*N
 
for i in range(2,N):
    fact[i] = (fact[i-1]*i)%mod
finv[-1] = pow(fact[-1],mod-2,mod)
for i in range(1,N)[::-1]:
    finv[i-1] = (finv[i]*i)%mod

def nCr(n,r):
    if r > n:
        return 0
    else: 
        return fact[n]*finv[r]%mod*finv[n-r]%mod


ans = 0

for i in range(1,n+1):
    c = nCr(n,i)
    if m < i or n-i+m-i < k:
        continue
    
    c2 = nCr(m,i)*fact[i]%mod
    c2 *= fact[m-i]*nCr(m-1,i-1)%mod
    ans += fact[n-1]*c%mod*c2%mod
    ans %= mod
print(ans)