n,m,k=map(int,input().split())
mod=10**9+7
ans=0
U=2*10**5
fact=[1]*(U+1)
fact_inv=[1]*(U+1)

for i in range(1,U+1):
    fact[i]=(fact[i-1]*i)%mod
fact_inv[U]=pow(fact[U],mod-2,mod)

for i in range(U,0,-1):
	fact_inv[i-1]=(fact_inv[i]*i)%mod

def comb(n,k):
    if k<0 or k>n:
        return 0
    x=fact[n]
    x*=fact_inv[k]
    x%=mod
    x*=fact_inv[n-k]
    x%=mod
    return x


for i in range(1,m+1):
    if n<i:
        break
    if n+m-2*i<k:
        continue
    ans=(ans+comb(n,i)*comb(m-1,i-1))%mod
import math
print((ans*math.factorial(n-1)*math.factorial(m))%mod)