n,m,k=map(int,input().split())
mod=10**9+7
framod=[1]
ans=0
def framod_calc(n, mod, a=1):
    for i in range(1,n+1):
        a=a * i % mod
        framod.append(a)
framod_calc(n+m+1, mod)

def permmod(n, k, mod):
    if n<k: return 0
    a=framod[n]
    c=framod[n-k]
    return (a * pow(c, mod-2, mod)) % mod

def combmod(n, k, mod):
    if n<k: return 0
    a=framod[n]
    b=framod[k]
    c=framod[n-k]
    return (a * pow(b, mod-2, mod) * pow(c, mod-2, mod)) % mod

if k==0:
    print(permmod(n+m-1,n+m-1,mod))
    exit()

for i in range(1, min(m+1, n+1)):
    if (n+m)-2*i>=k:
        ans+=(combmod(n, i, mod)*combmod(m-1,m-i,mod)*permmod(m,m,mod)*permmod(n-1,n-1,mod))%mod
        ans%=mod
    else:
        break
print(ans)