mod = 10**9 + 7
n, m, k = map(int, input().split())
nm = n * m
fact = [1] * (nm-1)
inv = [1] * (nm-1)
inv_fact = [1] * (nm-1)
for i in range(2, nm-1):
  fact[i] = fact[i-1] * i % mod
  inv[i] = -(mod // i) * inv[mod % i] % mod
  inv_fact[i] = inv_fact[i-1] * inv[i] % mod
comb = fact[nm-2] * inv_fact[k-2] * inv_fact[nm-k] % mod
cost_x = (n-1) * nm * (n+1) // 6 * m % mod
cost_y = (m-1) * nm * (m+1) // 6 * n % mod
print(comb * (cost_x + cost_y) % mod) mod = 10**9 + 7 mod 10**9 + 7 10**9 10 9 7 n, m, k = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split m k nm = n * m nm n * m n m fact = [1] * (nm-1) fact [1] * (nm-1) [1] 1 nm-1 nm 1 inv = [1] * (nm-1) inv [1] * (nm-1) [1] 1 nm-1 nm 1 inv_fact = [1] * (nm-1) inv_fact [1] * (nm-1) [1] 1 nm-1 nm 1 for i in range(2, nm-1):
  fact[i] = fact[i-1] * i % mod
  inv[i] = -(mod // i) * inv[mod % i] % mod
  inv_fact[i] = inv_fact[i-1] * inv[i] % mod i range(2, nm-1) range 2 nm-1 nm 1 fact[i] = fact[i-1] * i % mod fact[i] fact i fact[i-1] * i % mod fact[i-1] * i fact[i-1] fact i-1 i 1 i mod inv[i] = -(mod // i) * inv[mod % i] % mod inv[i] inv i -(mod // i) * inv[mod % i] % mod -(mod // i) * inv[mod % i] -(mod // i) mod // i mod i inv[mod % i] inv mod % i mod i mod inv_fact[i] = inv_fact[i-1] * inv[i] % mod inv_fact[i] inv_fact i inv_fact[i-1] * inv[i] % mod inv_fact[i-1] * inv[i] inv_fact[i-1] inv_fact i-1 i 1 inv[i] inv i mod comb = fact[nm-2] * inv_fact[k-2] * inv_fact[nm-k] % mod comb fact[nm-2] * inv_fact[k-2] * inv_fact[nm-k] % mod fact[nm-2] * inv_fact[k-2] * inv_fact[nm-k] fact[nm-2] * inv_fact[k-2] fact[nm-2] fact nm-2 nm 2 inv_fact[k-2] inv_fact k-2 k 2 inv_fact[nm-k] inv_fact nm-k nm k mod cost_x = (n-1) * nm * (n+1) // 6 * m % mod cost_x (n-1) * nm * (n+1) // 6 * m % mod (n-1) * nm * (n+1) // 6 * m (n-1) * nm * (n+1) // 6 (n-1) * nm * (n+1) (n-1) * nm n-1 n 1 nm n+1 n 1 6 m mod cost_y = (m-1) * nm * (m+1) // 6 * n % mod cost_y (m-1) * nm * (m+1) // 6 * n % mod (m-1) * nm * (m+1) // 6 * n (m-1) * nm * (m+1) // 6 (m-1) * nm * (m+1) (m-1) * nm m-1 m 1 nm m+1 m 1 6 n mod print(comb * (cost_x + cost_y) % mod) print comb * (cost_x + cost_y) % mod comb * (cost_x + cost_y) comb cost_x + cost_y cost_x cost_y mod cost_y = (m-1) * nm * (m+1) // 6 * n % mod (m-1) * nm * (m+1) // 6 * n % mod cost_y fact = [1] * (nm-1) [1] * (nm-1) fact inv = [1] * (nm-1) [1] * (nm-1) inv nm = n * m n * m nm mod = 10**9 + 7 10**9 + 7 mod n, m, k = map(int, input().split()) map(int, input().split()) n cost_x = (n-1) * nm * (n+1) // 6 * m % mod (n-1) * nm * (n+1) // 6 * m % mod cost_x k = map(int, input().split()) map(int, input().split()) k inv_fact = [1] * (nm-1) [1] * (nm-1) inv_fact m, k = map(int, input().split()) map(int, input().split()) m comb = fact[nm-2] * inv_fact[k-2] * inv_fact[nm-k] % mod fact[nm-2] * inv_fact[k-2] * inv_fact[nm-k] % mod comb
mod = 10**9 + 7
n, m, k = map(int, input().split())
nm = n * m
fact = [1] * (nm-1)
inv = [1] * (nm-1)
inv_fact = [1] * (nm-1)
for i in range(2, nm-1):
  fact[i] = fact[i-1] * i % mod
  inv[i] = -(mod // i) * inv[mod % i] % mod
  inv_fact[i] = inv_fact[i-1] * inv[i] % mod
comb = fact[nm-2] * inv_fact[k-2] * inv_fact[nm-k] % mod
cost_x = (n-1) * nm * (n+1) // 6 * m % mod
cost_y = (m-1) * nm * (m+1) // 6 * n % mod
print(comb * (cost_x + cost_y) % mod)