from math import factorial


def comb(n, k, mod):
  if n < 0 or k < 0 or n < k:
      return 0
  if n == 0 or k == 0:
      return 1
  
  a=factorial(n) % mod
  b=factorial(k) % mod
  c=factorial(n-k) % mod
  return (a*power_func(b, mod-2, mod)*power_func(c, mod-2, mod)) % mod


def power_func(a,b,mod):
  if b == 0:
      return 1
  if b % 2 == 0:
    d = power_func(a, b//2, mod)
    return d*d % mod
  if b % 2 == 1:
    return (a*power_func(a, b-1, mod)) % mod


N, M, K = map(int, input().split())
mod = 10**9 + 7


x = N*N*(M*M*(M+1)//2 - M*(M+1)*(2*M+1)//6)
y = M*M*(N*N*(N+1)//2 - N*(N+1)*(2*N+1)//6)
ans = comb(N*M-2, K-2, mod) * (x + y) % mod
print(ans) from math import factorial def comb(n, k, mod):
  if n < 0 or k < 0 or n < k:
      return 0
  if n == 0 or k == 0:
      return 1
  
  a=factorial(n) % mod
  b=factorial(k) % mod
  c=factorial(n-k) % mod
  return (a*power_func(b, mod-2, mod)*power_func(c, mod-2, mod)) % mod comb if n < 0 or k < 0 or n < k:
      return 0
   n < 0 or k < 0 or n < k n < 0 or k < 0 n < 0 n 0 k < 0 k 0 n < k n k return 0 0 if n == 0 or k == 0:
      return 1
  
   n == 0 or k == 0 n == 0 n 0 k == 0 k 0 return 1 1 a=factorial(n) % mod a factorial(n) % mod factorial(n) factorial n mod b=factorial(k) % mod b factorial(k) % mod factorial(k) factorial k mod c=factorial(n-k) % mod c factorial(n-k) % mod factorial(n-k) factorial n-k n k mod return (a*power_func(b, mod-2, mod)*power_func(c, mod-2, mod)) % mod (a*power_func(b, mod-2, mod)*power_func(c, mod-2, mod)) % mod a*power_func(b, mod-2, mod)*power_func(c, mod-2, mod) a*power_func(b, mod-2, mod) a power_func(b, mod-2, mod) power_func b mod-2 mod 2 mod power_func(c, mod-2, mod) power_func c mod-2 mod 2 mod mod n n k k mod mod def power_func(a,b,mod):
  if b == 0:
      return 1
  if b % 2 == 0:
    d = power_func(a, b//2, mod)
    return d*d % mod
  if b % 2 == 1:
    return (a*power_func(a, b-1, mod)) % mod power_func if b == 0:
      return 1
   b == 0 b 0 return 1 1 if b % 2 == 0:
    d = power_func(a, b//2, mod)
    return d*d % mod
   b % 2 == 0 b % 2 b 2 0 d = power_func(a, b//2, mod) d power_func(a, b//2, mod) power_func a b//2 b 2 mod return d*d % mod d*d % mod d*d d d mod if b % 2 == 1:
    return (a*power_func(a, b-1, mod)) % mod b % 2 == 1 b % 2 b 2 1 return (a*power_func(a, b-1, mod)) % mod (a*power_func(a, b-1, mod)) % mod a*power_func(a, b-1, mod) a power_func(a, b-1, mod) power_func a b-1 b 1 mod mod a a b b mod mod 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 x = N*N*(M*M*(M+1)//2 - M*(M+1)*(2*M+1)//6) x N*N*(M*M*(M+1)//2 - M*(M+1)*(2*M+1)//6) N*N N N M*M*(M+1)//2 - M*(M+1)*(2*M+1)//6 M*M*(M+1)//2 M*M*(M+1) M*M M M M+1 M 1 2 M*(M+1)*(2*M+1)//6 M*(M+1)*(2*M+1) M*(M+1) M M+1 M 1 2*M+1 2*M 2 M 1 6 y = M*M*(N*N*(N+1)//2 - N*(N+1)*(2*N+1)//6) y M*M*(N*N*(N+1)//2 - N*(N+1)*(2*N+1)//6) M*M M M N*N*(N+1)//2 - N*(N+1)*(2*N+1)//6 N*N*(N+1)//2 N*N*(N+1) N*N N N N+1 N 1 2 N*(N+1)*(2*N+1)//6 N*(N+1)*(2*N+1) N*(N+1) N N+1 N 1 2*N+1 2*N 2 N 1 6 ans = comb(N*M-2, K-2, mod) * (x + y) % mod ans comb(N*M-2, K-2, mod) * (x + y) % mod comb(N*M-2, K-2, mod) * (x + y) comb(N*M-2, K-2, mod) comb N*M-2 N*M N M 2 K-2 K 2 mod x + y x y mod print(ans) print ans N, M, K = map(int, input().split()) map(int, input().split()) N M, K = map(int, input().split()) map(int, input().split()) M x = N*N*(M*M*(M+1)//2 - M*(M+1)*(2*M+1)//6) N*N*(M*M*(M+1)//2 - M*(M+1)*(2*M+1)//6) x def comb(n, k, mod):
  if n < 0 or k < 0 or n < k:
      return 0
  if n == 0 or k == 0:
      return 1
  
  a=factorial(n) % mod
  b=factorial(k) % mod
  c=factorial(n-k) % mod
  return (a*power_func(b, mod-2, mod)*power_func(c, mod-2, mod)) % mod def comb(n, k, mod):
  if n < 0 or k < 0 or n < k:
      return 0
  if n == 0 or k == 0:
      return 1
  
  a=factorial(n) % mod
  b=factorial(k) % mod
  c=factorial(n-k) % mod
  return (a*power_func(b, mod-2, mod)*power_func(c, mod-2, mod)) % mod comb mod = 10**9 + 7 10**9 + 7 mod def power_func(a,b,mod):
  if b == 0:
      return 1
  if b % 2 == 0:
    d = power_func(a, b//2, mod)
    return d*d % mod
  if b % 2 == 1:
    return (a*power_func(a, b-1, mod)) % mod def power_func(a,b,mod):
  if b == 0:
      return 1
  if b % 2 == 0:
    d = power_func(a, b//2, mod)
    return d*d % mod
  if b % 2 == 1:
    return (a*power_func(a, b-1, mod)) % mod power_func K = map(int, input().split()) map(int, input().split()) K ans = comb(N*M-2, K-2, mod) * (x + y) % mod comb(N*M-2, K-2, mod) * (x + y) % mod ans y = M*M*(N*N*(N+1)//2 - N*(N+1)*(2*N+1)//6) M*M*(N*N*(N+1)//2 - N*(N+1)*(2*N+1)//6) y
from math import factorial


def comb(n, k, mod):
  if n < 0 or k < 0 or n < k:
      return 0
  if n == 0 or k == 0:
      return 1
  
  a=factorial(n) % mod
  b=factorial(k) % mod
  c=factorial(n-k) % mod
  return (a*power_func(b, mod-2, mod)*power_func(c, mod-2, mod)) % mod


def power_func(a,b,mod):
  if b == 0:
      return 1
  if b % 2 == 0:
    d = power_func(a, b//2, mod)
    return d*d % mod
  if b % 2 == 1:
    return (a*power_func(a, b-1, mod)) % mod


N, M, K = map(int, input().split())
mod = 10**9 + 7


x = N*N*(M*M*(M+1)//2 - M*(M+1)*(2*M+1)//6)
y = M*M*(N*N*(N+1)//2 - N*(N+1)*(2*N+1)//6)
ans = comb(N*M-2, K-2, mod) * (x + y) % mod
print(ans)