import sys
input = sys.stdin.readline
N, M, K = map(int, input().split())
mod = 10 ** 9 + 7
class Factorial:
  def __init__(self, n, mod):
    self.f = [1]
    for i in range(1, n + 1):
      self.f.append(self.f[-1] * i % mod)
    self.i = [pow(self.f[-1], mod - 2, mod)]
    for i in range(1, n + 1)[: : -1]:
      self.i.append(self.i[-1] * i % mod)
    self.i.reverse()
  def factorial(self, i):
    return self.f[i]
  def ifactorial(self, i):
    return self.i[i]
  def combi(self, n, k):
    return self.f[n] * self.i[n - k] % mod * self.i[k] % mod

f = Factorial(N * M, mod)
t = f.combi(N * M - 2, K - 2)

res = 0
for d in range(1, M):
  x = N ** 2 % mod * (M - d) % mod
  res += x * d % mod
  res %= mod
  #print(x)
for d in range(1, N):
  y = M ** 2 % mod * (N - d) % mod
  res += y * d % mod
  res %= mod
#print(res, t)
print(res * t % mod) import sys sys input = sys.stdin.readline input sys.stdin.readline sys.stdin sys stdin readline 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 class Factorial:
  def __init__(self, n, mod):
    self.f = [1]
    for i in range(1, n + 1):
      self.f.append(self.f[-1] * i % mod)
    self.i = [pow(self.f[-1], mod - 2, mod)]
    for i in range(1, n + 1)[: : -1]:
      self.i.append(self.i[-1] * i % mod)
    self.i.reverse()
  def factorial(self, i):
    return self.f[i]
  def ifactorial(self, i):
    return self.i[i]
  def combi(self, n, k):
    return self.f[n] * self.i[n - k] % mod * self.i[k] % mod Factorial def __init__(self, n, mod):
    self.f = [1]
    for i in range(1, n + 1):
      self.f.append(self.f[-1] * i % mod)
    self.i = [pow(self.f[-1], mod - 2, mod)]
    for i in range(1, n + 1)[: : -1]:
      self.i.append(self.i[-1] * i % mod)
    self.i.reverse()
   __init__ self.f = [1] self.f self f [1] 1 for i in range(1, n + 1):
      self.f.append(self.f[-1] * i % mod)
     i range(1, n + 1) range 1 n + 1 n 1 self.f.append(self.f[-1] * i % mod) self.f.append self.f self f append self.f[-1] * i % mod self.f[-1] * i self.f[-1] self.f self f -1 i mod self.i = [pow(self.f[-1], mod - 2, mod)] self.i self i [pow(self.f[-1], mod - 2, mod)] pow(self.f[-1], mod - 2, mod) pow self.f[-1] self.f self f -1 mod - 2 mod 2 mod for i in range(1, n + 1)[: : -1]:
      self.i.append(self.i[-1] * i % mod)
     i range(1, n + 1)[: : -1] (1, n + 1) range 1 n + 1 n 1 : : -1 -1 self.i.append(self.i[-1] * i % mod) self.i.append self.i self i append self.i[-1] * i % mod self.i[-1] * i self.i[-1] self.i self i -1 i mod self.i.reverse() self.i.reverse self.i self i reverse self self n n mod mod def factorial(self, i):
    return self.f[i]
   factorial return self.f[i] self.f[i] self.f self f i self self i i def ifactorial(self, i):
    return self.i[i]
   ifactorial return self.i[i] self.i[i] self.i self i i self self i i def combi(self, n, k):
    return self.f[n] * self.i[n - k] % mod * self.i[k] % mod combi return self.f[n] * self.i[n - k] % mod * self.i[k] % mod self.f[n] * self.i[n - k] % mod * self.i[k] % mod self.f[n] * self.i[n - k] % mod * self.i[k] self.f[n] * self.i[n - k] % mod self.f[n] * self.i[n - k] self.f[n] self.f self f n self.i[n - k] self.i self i n - k n k mod self.i[k] self.i self i k mod self self n n k k f = Factorial(N * M, mod) f Factorial(N * M, mod) Factorial N * M N M mod t = f.combi(N * M - 2, K - 2) t f.combi(N * M - 2, K - 2) f.combi f combi N * M - 2 N * M N M 2 K - 2 K 2 res = 0 res 0 for d in range(1, M):
  x = N ** 2 % mod * (M - d) % mod
  res += x * d % mod
  res %= mod
  #print(x) d range(1, M) range 1 M x = N ** 2 % mod * (M - d) % mod x N ** 2 % mod * (M - d) % mod N ** 2 % mod * (M - d) N ** 2 % mod N ** 2 N 2 mod M - d M d mod res += x * d % mod res x * d % mod x * d x d mod res %= mod res mod for d in range(1, N):
  y = M ** 2 % mod * (N - d) % mod
  res += y * d % mod
  res %= mod
#print(res, t) d range(1, N) range 1 N y = M ** 2 % mod * (N - d) % mod y M ** 2 % mod * (N - d) % mod M ** 2 % mod * (N - d) M ** 2 % mod M ** 2 M 2 mod N - d N d mod res += y * d % mod res y * d % mod y * d y d mod res %= mod res mod print(res * t % mod) print res * t % mod res * t res t mod y = M ** 2 % mod * (N - d) % mod M ** 2 % mod * (N - d) % mod y mod = 10 ** 9 + 7 10 ** 9 + 7 mod f = Factorial(N * M, mod) Factorial(N * M, mod) f t = f.combi(N * M - 2, K - 2) f.combi(N * M - 2, K - 2) t N, M, K = map(int, input().split()) map(int, input().split()) N K = map(int, input().split()) map(int, input().split()) K class Factorial:
  def __init__(self, n, mod):
    self.f = [1]
    for i in range(1, n + 1):
      self.f.append(self.f[-1] * i % mod)
    self.i = [pow(self.f[-1], mod - 2, mod)]
    for i in range(1, n + 1)[: : -1]:
      self.i.append(self.i[-1] * i % mod)
    self.i.reverse()
  def factorial(self, i):
    return self.f[i]
  def ifactorial(self, i):
    return self.i[i]
  def combi(self, n, k):
    return self.f[n] * self.i[n - k] % mod * self.i[k] % mod class Factorial:
  def __init__(self, n, mod):
    self.f = [1]
    for i in range(1, n + 1):
      self.f.append(self.f[-1] * i % mod)
    self.i = [pow(self.f[-1], mod - 2, mod)]
    for i in range(1, n + 1)[: : -1]:
      self.i.append(self.i[-1] * i % mod)
    self.i.reverse()
  def factorial(self, i):
    return self.f[i]
  def ifactorial(self, i):
    return self.i[i]
  def combi(self, n, k):
    return self.f[n] * self.i[n - k] % mod * self.i[k] % mod Factorial res += y * d % mod y * d % mod res input = sys.stdin.readline sys.stdin.readline input res = 0 0 res res += x * d % mod x * d % mod res res %= mod mod res x = N ** 2 % mod * (M - d) % mod N ** 2 % mod * (M - d) % mod x M, K = map(int, input().split()) map(int, input().split()) M res %= mod mod res
import sys
input = sys.stdin.readline
N, M, K = map(int, input().split())
mod = 10 ** 9 + 7
class Factorial:
  def __init__(self, n, mod):
    self.f = [1]
    for i in range(1, n + 1):
      self.f.append(self.f[-1] * i % mod)
    self.i = [pow(self.f[-1], mod - 2, mod)]
    for i in range(1, n + 1)[: : -1]:
      self.i.append(self.i[-1] * i % mod)
    self.i.reverse()
  def factorial(self, i):
    return self.f[i]
  def ifactorial(self, i):
    return self.i[i]
  def combi(self, n, k):
    return self.f[n] * self.i[n - k] % mod * self.i[k] % mod

f = Factorial(N * M, mod)
t = f.combi(N * M - 2, K - 2)

res = 0
for d in range(1, M):
  x = N ** 2 % mod * (M - d) % mod
  res += x * d % mod
  res %= mod
  #print(x)
for d in range(1, N):
  y = M ** 2 % mod * (N - d) % mod
  res += y * d % mod
  res %= mod
#print(res, t)
print(res * t % mod)