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

def comb(n, r, mod=10**9+7):
  if n==0 and r==0:
    return 1
  else:
    a = b = 1
    A, B = n, r
    for i in range(r):
      a = a*A % mod
      b = b*B % mod
      A -= 1
      B -= 1
    return a * pow(b, mod-2, mod) % mod

ans = comb(N*M-2, K-2) * ((M*(N-1)*(N+1) + N*(M-1)*(M+1))*N*M//6)%MOD % MOD
print(ans) 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 comb(n, r, mod=10**9+7):
  if n==0 and r==0:
    return 1
  else:
    a = b = 1
    A, B = n, r
    for i in range(r):
      a = a*A % mod
      b = b*B % mod
      A -= 1
      B -= 1
    return a * pow(b, mod-2, mod) % mod comb if n==0 and r==0:
    return 1
  else:
    a = b = 1
    A, B = n, r
    for i in range(r):
      a = a*A % mod
      b = b*B % mod
      A -= 1
      B -= 1
    return a * pow(b, mod-2, mod) % mod n==0 and r==0 n==0 n 0 r==0 r 0 return 1 1 a = b = 1 a 1 = b = 1 b 1 A, B = n, r A n B r for i in range(r):
      a = a*A % mod
      b = b*B % mod
      A -= 1
      B -= 1
     i range(r) range r a = a*A % mod a a*A % mod a*A a A mod b = b*B % mod b b*B % mod b*B b B mod A -= 1 A 1 B -= 1 B 1 return a * pow(b, mod-2, mod) % mod a * pow(b, mod-2, mod) % mod a * pow(b, mod-2, mod) a pow(b, mod-2, mod) pow b mod-2 mod 2 mod mod n n r r mod=10**9+7 mod 10**9+7 10**9 10 9 7 ans = comb(N*M-2, K-2) * ((M*(N-1)*(N+1) + N*(M-1)*(M+1))*N*M//6)%MOD % MOD ans comb(N*M-2, K-2) * ((M*(N-1)*(N+1) + N*(M-1)*(M+1))*N*M//6)%MOD % MOD comb(N*M-2, K-2) * ((M*(N-1)*(N+1) + N*(M-1)*(M+1))*N*M//6)%MOD comb(N*M-2, K-2) * ((M*(N-1)*(N+1) + N*(M-1)*(M+1))*N*M//6) comb(N*M-2, K-2) comb N*M-2 N*M N M 2 K-2 K 2 (M*(N-1)*(N+1) + N*(M-1)*(M+1))*N*M//6 (M*(N-1)*(N+1) + N*(M-1)*(M+1))*N*M (M*(N-1)*(N+1) + N*(M-1)*(M+1))*N M*(N-1)*(N+1) + N*(M-1)*(M+1) M*(N-1)*(N+1) M*(N-1) M N-1 N 1 N+1 N 1 N*(M-1)*(M+1) N*(M-1) N M-1 M 1 M+1 M 1 N M 6 MOD MOD print(ans) print ans MOD = 10**9 + 7 10**9 + 7 MOD K = map(int, input().split()) map(int, input().split()) K ans = comb(N*M-2, K-2) * ((M*(N-1)*(N+1) + N*(M-1)*(M+1))*N*M//6)%MOD % MOD comb(N*M-2, K-2) * ((M*(N-1)*(N+1) + N*(M-1)*(M+1))*N*M//6)%MOD % MOD ans N, M ,K = map(int, input().split()) map(int, input().split()) N def comb(n, r, mod=10**9+7):
  if n==0 and r==0:
    return 1
  else:
    a = b = 1
    A, B = n, r
    for i in range(r):
      a = a*A % mod
      b = b*B % mod
      A -= 1
      B -= 1
    return a * pow(b, mod-2, mod) % mod def comb(n, r, mod=10**9+7):
  if n==0 and r==0:
    return 1
  else:
    a = b = 1
    A, B = n, r
    for i in range(r):
      a = a*A % mod
      b = b*B % mod
      A -= 1
      B -= 1
    return a * pow(b, mod-2, mod) % mod comb M ,K = map(int, input().split()) map(int, input().split()) M
N, M ,K = map(int, input().split())
MOD = 10**9 + 7

def comb(n, r, mod=10**9+7):
  if n==0 and r==0:
    return 1
  else:
    a = b = 1
    A, B = n, r
    for i in range(r):
      a = a*A % mod
      b = b*B % mod
      A -= 1
      B -= 1
    return a * pow(b, mod-2, mod) % mod

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