mod = 10**9+7
comb_num = 10**7 + 2
F = [1] * comb_num
F_ = [1] * comb_num
for i in range(2, comb_num): F[i] = F[i-1]*i%mod
F_[-1] = pow(F[-1], -1, mod)
for i in range(comb_num-1, 0, -1): F_[i-1] = F_[i]*i%mod
def comb(a, b):
    if 0 <= b <= a: return F[a] * F_[b] * F_[a-b] % mod
    else: return 0

n, m, k = list(map(int, input().split()))
ans0 = F[n-1] * F[m] % mod
ans1 = 0
A = []
for a in range(1, n+1):
    if (n+m-2*a) < k: continue
    ans1 = (ans1 + comb(n, a) * comb(m-1, a-1)) % mod
print(ans0 * ans1 % mod)