n,m,k = map(int,input().split())
mod = 10**9+7

def make_array_for_comb(N, mod=10**9+7):
    fact = [1,1]
    fact_inv = [1,1]
    inv = [0,1]
    for i in range(2, N+1):
        fact.append((fact[-1]*i) % mod)
        inv.append((-inv[mod%i] * (mod//i)) % mod)
        fact_inv.append((fact_inv[-1]*inv[i]) % mod)
    return fact, fact_inv

def comb(n, r, mod=10**9+7):
  if (r < 0) or (n < r):
      return 0
  r = min(r, n - r)
  return fact[n] * fact_inv[r] * fact_inv[n-r] % mod

fact, fact_inv = make_array_for_comb(n*m,mod)

l = comb(n*m-2,k-2,mod)
ans = 0
for a in range(1,n+1):
  ans += a*m*(a-1)*m
  ans -= a*m*(n-a)*m
ans %= mod

for b in range(1,m+1):
  ans += b*n*(b-1)*n
  ans -= b*n*(m-b)*n
ans %= mod

print(ans*l%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 def make_array_for_comb(N, mod=10**9+7):
    fact = [1,1]
    fact_inv = [1,1]
    inv = [0,1]
    for i in range(2, N+1):
        fact.append((fact[-1]*i) % mod)
        inv.append((-inv[mod%i] * (mod//i)) % mod)
        fact_inv.append((fact_inv[-1]*inv[i]) % mod)
    return fact, fact_inv make_array_for_comb fact = [1,1] fact [1,1] 1 1 fact_inv = [1,1] fact_inv [1,1] 1 1 inv = [0,1] inv [0,1] 0 1 for i in range(2, N+1):
        fact.append((fact[-1]*i) % mod)
        inv.append((-inv[mod%i] * (mod//i)) % mod)
        fact_inv.append((fact_inv[-1]*inv[i]) % mod)
     i range(2, N+1) range 2 N+1 N 1 fact.append((fact[-1]*i) % mod) fact.append fact append (fact[-1]*i) % mod fact[-1]*i fact[-1] fact -1 i mod inv.append((-inv[mod%i] * (mod//i)) % mod) inv.append inv append (-inv[mod%i] * (mod//i)) % mod -inv[mod%i] * (mod//i) -inv[mod%i] inv[mod%i] inv mod%i mod i mod//i mod i mod fact_inv.append((fact_inv[-1]*inv[i]) % mod) fact_inv.append fact_inv append (fact_inv[-1]*inv[i]) % mod fact_inv[-1]*inv[i] fact_inv[-1] fact_inv -1 inv[i] inv i mod return fact, fact_inv return fact, fact_inv fact fact_inv N N mod=10**9+7 mod 10**9+7 10**9 10 9 7 def comb(n, r, mod=10**9+7):
  if (r < 0) or (n < r):
      return 0
  r = min(r, n - r)
  return fact[n] * fact_inv[r] * fact_inv[n-r] % mod comb if (r < 0) or (n < r):
      return 0
   (r < 0) or (n < r) r < 0 r 0 n < r n r return 0 0 r = min(r, n - r) r min(r, n - r) min r n - r n r return fact[n] * fact_inv[r] * fact_inv[n-r] % mod fact[n] * fact_inv[r] * fact_inv[n-r] % mod fact[n] * fact_inv[r] * fact_inv[n-r] fact[n] * fact_inv[r] fact[n] fact n fact_inv[r] fact_inv r fact_inv[n-r] fact_inv n-r n r mod n n r r mod=10**9+7 mod 10**9+7 10**9 10 9 7 fact, fact_inv = make_array_for_comb(n*m,mod) fact make_array_for_comb(n*m,mod) make_array_for_comb n*m n m mod fact_inv l = comb(n*m-2,k-2,mod) l comb(n*m-2,k-2,mod) comb n*m-2 n*m n m 2 k-2 k 2 mod ans = 0 ans 0 for a in range(1,n+1):
  ans += a*m*(a-1)*m
  ans -= a*m*(n-a)*m a range(1,n+1) range 1 n+1 n 1 ans += a*m*(a-1)*m ans a*m*(a-1)*m a*m*(a-1) a*m a m a-1 a 1 m ans -= a*m*(n-a)*m ans a*m*(n-a)*m a*m*(n-a) a*m a m n-a n a m ans %= mod ans mod for b in range(1,m+1):
  ans += b*n*(b-1)*n
  ans -= b*n*(m-b)*n b range(1,m+1) range 1 m+1 m 1 ans += b*n*(b-1)*n ans b*n*(b-1)*n b*n*(b-1) b*n b n b-1 b 1 n ans -= b*n*(m-b)*n ans b*n*(m-b)*n b*n*(m-b) b*n b n m-b m b n ans %= mod ans mod print(ans*l%mod) print ans*l%mod ans*l ans l mod ans -= a*m*(n-a)*m a*m*(n-a)*m ans l = comb(n*m-2,k-2,mod) comb(n*m-2,k-2,mod) l n,m,k = map(int,input().split()) map(int,input().split()) n fact, fact_inv = make_array_for_comb(n*m,mod) make_array_for_comb(n*m,mod) fact ans += b*n*(b-1)*n b*n*(b-1)*n ans ans -= b*n*(m-b)*n b*n*(m-b)*n ans mod = 10**9+7 10**9+7 mod k = map(int,input().split()) map(int,input().split()) k ans %= mod mod ans ans += a*m*(a-1)*m a*m*(a-1)*m ans def comb(n, r, mod=10**9+7):
  if (r < 0) or (n < r):
      return 0
  r = min(r, n - r)
  return fact[n] * fact_inv[r] * fact_inv[n-r] % mod def comb(n, r, mod=10**9+7):
  if (r < 0) or (n < r):
      return 0
  r = min(r, n - r)
  return fact[n] * fact_inv[r] * fact_inv[n-r] % mod comb ans %= mod mod ans m,k = map(int,input().split()) map(int,input().split()) m ans = 0 0 ans def make_array_for_comb(N, mod=10**9+7):
    fact = [1,1]
    fact_inv = [1,1]
    inv = [0,1]
    for i in range(2, N+1):
        fact.append((fact[-1]*i) % mod)
        inv.append((-inv[mod%i] * (mod//i)) % mod)
        fact_inv.append((fact_inv[-1]*inv[i]) % mod)
    return fact, fact_inv def make_array_for_comb(N, mod=10**9+7):
    fact = [1,1]
    fact_inv = [1,1]
    inv = [0,1]
    for i in range(2, N+1):
        fact.append((fact[-1]*i) % mod)
        inv.append((-inv[mod%i] * (mod//i)) % mod)
        fact_inv.append((fact_inv[-1]*inv[i]) % mod)
    return fact, fact_inv make_array_for_comb fact_inv = make_array_for_comb(n*m,mod) make_array_for_comb(n*m,mod) fact_inv
n,m,k = map(int,input().split())
mod = 10**9+7

def make_array_for_comb(N, mod=10**9+7):
    fact = [1,1]
    fact_inv = [1,1]
    inv = [0,1]
    for i in range(2, N+1):
        fact.append((fact[-1]*i) % mod)
        inv.append((-inv[mod%i] * (mod//i)) % mod)
        fact_inv.append((fact_inv[-1]*inv[i]) % mod)
    return fact, fact_inv

def comb(n, r, mod=10**9+7):
  if (r < 0) or (n < r):
      return 0
  r = min(r, n - r)
  return fact[n] * fact_inv[r] * fact_inv[n-r] % mod

fact, fact_inv = make_array_for_comb(n*m,mod)

l = comb(n*m-2,k-2,mod)
ans = 0
for a in range(1,n+1):
  ans += a*m*(a-1)*m
  ans -= a*m*(n-a)*m
ans %= mod

for b in range(1,m+1):
  ans += b*n*(b-1)*n
  ans -= b*n*(m-b)*n
ans %= mod

print(ans*l%mod)