N, M, K = map(int, input().split())
mod =10**9+7
fac = [0]*(max(N,M)+1)
inv = [0]*(max(N,M)+1)
fac[0]=inv[0]=1
for i in range(1,max(N,M)+1):
    fac[i] = (fac[i-1]*i)%mod
    inv[i] = (inv[i-1]*pow(i,mod-2,mod))%mod

cnt = 0
for i in range(1,min(N,M)+1):
    if N+M-2*i>=K:
        cnt += (fac[N-i+i-1]*inv[N-i]*inv[i-1]*fac[M-i+i-1]*inv[M-i]*inv[i-1]*pow(i,mod-2,mod))%mod
        cnt %= mod
print((cnt*fac[N]*fac[M])%mod)