n,m,k=map(int,input().split())

mod=10**9+7
if m>n:
    n,m=m,n
N=n
fac=[1]*(N+3)
inv=[1]*(N+3)
t=1
for i in range(1,N+3):
    t*=i
    t%=mod
    fac[i]=t
t=pow(fac[N+2],mod-2,mod)
for i in range(N+2,0,-1):
    inv[i]=t
    t*=i
    t%=mod
def comb(n,r):
    if r>n or r<0:
        return 0
    return fac[n]*inv[n-r]*inv[r]%mod
ans=0
for i in range(1,m+1):
    if n+m-i*2<k:
        break
    ans+=fac[n-1]*comb(n,i)%mod*fac[m]*comb(m-1,i-1)%mod
    ans%=mod
print(ans)