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

mod = 10**9 + 7
n = 2*10**5

fact = [1]*(n+1)
rfact = [1]*(n+1)
r = 1
for i in range(1, n+1):
  fact[i] = r = r * i % mod
rfact[n] = r = pow(fact[n], mod-2, mod)
for i in range(n, 0, -1):
  rfact[i-1] = r = r * i % mod

def comb(n, k):
  return fact[n] * rfact[k] * rfact[n-k] % mod

base = comb(N*M-2,K-2)
first = 0
for i in range(N):
  for j in range(M):
    first += (i+j)
dp = [0]*M
dp[0] = first
for i in range(1,M):
  dp[i] = dp[i-1] - (M-2*i) * N
SUM = sum(dp)
dp2 = [0]*N
dp2[0] = SUM
for i in range(1,N):
  dp2[i] = dp2[i-1] - (N-2*i) * (M ** 2)
SUM = sum(dp2)
ans = comb(N*M-2,K-2) * (SUM % mod) * pow(2,mod-2,mod)
ans %= 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 n = 2*10**5 n 2*10**5 2 10**5 10 5 fact = [1]*(n+1) fact [1]*(n+1) [1] 1 n+1 n 1 rfact = [1]*(n+1) rfact [1]*(n+1) [1] 1 n+1 n 1 r = 1 r 1 for i in range(1, n+1):
  fact[i] = r = r * i % mod i range(1, n+1) range 1 n+1 n 1 fact[i] = r = r * i % mod fact[i] fact i r * i % mod r * i r i mod = r = r * i % mod r r * i % mod rfact[n] = r = pow(fact[n], mod-2, mod) rfact[n] rfact n pow(fact[n], mod-2, mod) pow fact[n] fact n mod-2 mod 2 mod = r = pow(fact[n], mod-2, mod) r pow(fact[n], mod-2, mod) for i in range(n, 0, -1):
  rfact[i-1] = r = r * i % mod i range(n, 0, -1) range n 0 -1 rfact[i-1] = r = r * i % mod rfact[i-1] rfact i-1 i 1 r * i % mod r * i r i mod = r = r * i % mod r r * i % mod def comb(n, k):
  return fact[n] * rfact[k] * rfact[n-k] % mod comb return fact[n] * rfact[k] * rfact[n-k] % mod fact[n] * rfact[k] * rfact[n-k] % mod fact[n] * rfact[k] * rfact[n-k] fact[n] * rfact[k] fact[n] fact n rfact[k] rfact k rfact[n-k] rfact n-k n k mod n n k k base = comb(N*M-2,K-2) base comb(N*M-2,K-2) comb N*M-2 N*M N M 2 K-2 K 2 first = 0 first 0 for i in range(N):
  for j in range(M):
    first += (i+j) i range(N) range N for j in range(M):
    first += (i+j) j range(M) range M first += (i+j) first i+j i j dp = [0]*M dp [0]*M [0] 0 M dp[0] = first dp[0] dp 0 first for i in range(1,M):
  dp[i] = dp[i-1] - (M-2*i) * N i range(1,M) range 1 M dp[i] = dp[i-1] - (M-2*i) * N dp[i] dp i dp[i-1] - (M-2*i) * N dp[i-1] dp i-1 i 1 (M-2*i) * N M-2*i M 2*i 2 i N SUM = sum(dp) SUM sum(dp) sum dp dp2 = [0]*N dp2 [0]*N [0] 0 N dp2[0] = SUM dp2[0] dp2 0 SUM for i in range(1,N):
  dp2[i] = dp2[i-1] - (N-2*i) * (M ** 2) i range(1,N) range 1 N dp2[i] = dp2[i-1] - (N-2*i) * (M ** 2) dp2[i] dp2 i dp2[i-1] - (N-2*i) * (M ** 2) dp2[i-1] dp2 i-1 i 1 (N-2*i) * (M ** 2) N-2*i N 2*i 2 i M ** 2 M 2 SUM = sum(dp2) SUM sum(dp2) sum dp2 ans = comb(N*M-2,K-2) * (SUM % mod) * pow(2,mod-2,mod) ans comb(N*M-2,K-2) * (SUM % mod) * pow(2,mod-2,mod) comb(N*M-2,K-2) * (SUM % mod) comb(N*M-2,K-2) comb N*M-2 N*M N M 2 K-2 K 2 SUM % mod SUM mod pow(2,mod-2,mod) pow 2 mod-2 mod 2 mod ans %= mod ans mod print(ans) print ans ans %= mod mod ans r = r * i % mod r * i % mod r first += (i+j) i+j first dp = [0]*M [0]*M dp r = pow(fact[n], mod-2, mod) pow(fact[n], mod-2, mod) r SUM = sum(dp) sum(dp) SUM n = 2*10**5 2*10**5 n M,K = map(int, input().split()) map(int, input().split()) M first = 0 0 first rfact = [1]*(n+1) [1]*(n+1) rfact K = map(int, input().split()) map(int, input().split()) K base = comb(N*M-2,K-2) comb(N*M-2,K-2) base SUM = sum(dp2) sum(dp2) SUM N,M,K = map(int, input().split()) map(int, input().split()) N fact = [1]*(n+1) [1]*(n+1) fact r = r * i % mod r * i % mod r ans = comb(N*M-2,K-2) * (SUM % mod) * pow(2,mod-2,mod) comb(N*M-2,K-2) * (SUM % mod) * pow(2,mod-2,mod) ans mod = 10**9 + 7 10**9 + 7 mod dp2 = [0]*N [0]*N dp2 def comb(n, k):
  return fact[n] * rfact[k] * rfact[n-k] % mod def comb(n, k):
  return fact[n] * rfact[k] * rfact[n-k] % mod comb r = 1 1 r
N,M,K = map(int, input().split())

mod = 10**9 + 7
n = 2*10**5

fact = [1]*(n+1)
rfact = [1]*(n+1)
r = 1
for i in range(1, n+1):
  fact[i] = r = r * i % mod
rfact[n] = r = pow(fact[n], mod-2, mod)
for i in range(n, 0, -1):
  rfact[i-1] = r = r * i % mod

def comb(n, k):
  return fact[n] * rfact[k] * rfact[n-k] % mod

base = comb(N*M-2,K-2)
first = 0
for i in range(N):
  for j in range(M):
    first += (i+j)
dp = [0]*M
dp[0] = first
for i in range(1,M):
  dp[i] = dp[i-1] - (M-2*i) * N
SUM = sum(dp)
dp2 = [0]*N
dp2[0] = SUM
for i in range(1,N):
  dp2[i] = dp2[i-1] - (N-2*i) * (M ** 2)
SUM = sum(dp2)
ans = comb(N*M-2,K-2) * (SUM % mod) * pow(2,mod-2,mod)
ans %= mod
print(ans)
