from math import factorial as f
N, M, K = map(int, input().split())
mod = 10 ** 9 + 7

def combi(n, r):
  return f(n) // (f(n - r) * f(r)) % mod

res = 0
c = combi(N * M - 2, K - 2)
for i in range(1, N):
  res += ((N - i + 1) * (N - i) // 2) * c * M * M % mod
  res %= mod

for i in range(1, M):
  res += ((M - i + 1) * (M - i) // 2) * c * N * N % mod
  res %= mod

print(res % mod)
 from math import factorial as f N, M, K = map(int, input().split()) N map(int, input().split()) map int input().split() ().split () input split M K mod = 10 ** 9 + 7 mod 10 ** 9 + 7 10 ** 9 10 9 7 def combi(n, r):
  return f(n) // (f(n - r) * f(r)) % mod combi return f(n) // (f(n - r) * f(r)) % mod f(n) // (f(n - r) * f(r)) % mod f(n) // (f(n - r) * f(r)) f(n) f n f(n - r) * f(r) f(n - r) f n - r n r f(r) f r mod n n r r res = 0 res 0 c = combi(N * M - 2, K - 2) c combi(N * M - 2, K - 2) combi N * M - 2 N * M N M 2 K - 2 K 2 for i in range(1, N):
  res += ((N - i + 1) * (N - i) // 2) * c * M * M % mod
  res %= mod i range(1, N) range 1 N res += ((N - i + 1) * (N - i) // 2) * c * M * M % mod res ((N - i + 1) * (N - i) // 2) * c * M * M % mod ((N - i + 1) * (N - i) // 2) * c * M * M ((N - i + 1) * (N - i) // 2) * c * M ((N - i + 1) * (N - i) // 2) * c (N - i + 1) * (N - i) // 2 (N - i + 1) * (N - i) N - i + 1 N - i N i 1 N - i N i 2 c M M mod res %= mod res mod for i in range(1, M):
  res += ((M - i + 1) * (M - i) // 2) * c * N * N % mod
  res %= mod i range(1, M) range 1 M res += ((M - i + 1) * (M - i) // 2) * c * N * N % mod res ((M - i + 1) * (M - i) // 2) * c * N * N % mod ((M - i + 1) * (M - i) // 2) * c * N * N ((M - i + 1) * (M - i) // 2) * c * N ((M - i + 1) * (M - i) // 2) * c (M - i + 1) * (M - i) // 2 (M - i + 1) * (M - i) M - i + 1 M - i M i 1 M - i M i 2 c N N mod res %= mod res mod print(res % mod) print res % mod res mod def combi(n, r):
  return f(n) // (f(n - r) * f(r)) % mod def combi(n, r):
  return f(n) // (f(n - r) * f(r)) % mod combi res = 0 0 res c = combi(N * M - 2, K - 2) combi(N * M - 2, K - 2) c res %= mod mod res res += ((M - i + 1) * (M - i) // 2) * c * N * N % mod ((M - i + 1) * (M - i) // 2) * c * N * N % mod res res += ((N - i + 1) * (N - i) // 2) * c * M * M % mod ((N - i + 1) * (N - i) // 2) * c * M * M % mod res K = map(int, input().split()) map(int, input().split()) K N, M, K = map(int, input().split()) map(int, input().split()) N mod = 10 ** 9 + 7 10 ** 9 + 7 mod res %= mod mod res M, K = map(int, input().split()) map(int, input().split()) M
from math import factorial as f
N, M, K = map(int, input().split())
mod = 10 ** 9 + 7

def combi(n, r):
  return f(n) // (f(n - r) * f(r)) % mod

res = 0
c = combi(N * M - 2, K - 2)
for i in range(1, N):
  res += ((N - i + 1) * (N - i) // 2) * c * M * M % mod
  res %= mod

for i in range(1, M):
  res += ((M - i + 1) * (M - i) // 2) * c * N * N % mod
  res %= mod

print(res % mod)

