MOD = 10 ** 9 + 7
modinv = lambda a, mod=10 ** 9 + 7: pow(a, mod - 2, mod)

N, M, K = map(int, input().split())

fac, inv = [1] * (max(N, M) + 1), [1] * (max(N, M) + 1)
for i in range(1, max(N, M) + 1):
    fac[i] = fac[i - 1] * i % MOD
    inv[i] = modinv(fac[i])
comb = lambda n, r: (fac[n] * inv[r] * inv[n - r]) % MOD

x = 1
ans = 0
while N + M - 2 * x >= K and x <= min(N, M):
    ans = (ans + fac[N] * fac[M] * comb(N - 1, x - 1) * comb(M - 1, x - 1) * modinv(x)) % MOD
    x += 1
print(ans)