MOD = 10**9 + 7
N = 10**6 + 10

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

# nPk (mod MOD) を求める
def perm(n, k):
  return fact[n] * rfact[n-k] % MOD

# nCk (mod MOD) を求める
def comb(n, k):
  return fact[n] * rfact[k] * rfact[n-k] % MOD

n,m,k = map(int,input().split())

p = comb(n*m-2, k-2)

ans = 0
for i in range(1,n):
    ans += i * (n-i) * m * m * p
    ans %= MOD

for i in range(1,m):
    ans += i * (m-i) * n * n * p
    ans %= MOD

print(ans) MOD = 10**9 + 7 MOD 10**9 + 7 10**9 10 9 7 N = 10**6 + 10 N 10**6 + 10 10**6 10 6 10 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

# nPk (mod 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 perm(n, k):
  return fact[n] * rfact[n-k] % MOD

# nCk (mod MOD) を求める perm return fact[n] * rfact[n-k] % MOD fact[n] * rfact[n-k] % MOD fact[n] * rfact[n-k] fact[n] fact n rfact[n-k] rfact n-k n k MOD n n k k 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 n,m,k = map(int,input().split()) n map(int,input().split()) map int input().split() ().split () input split m k p = comb(n*m-2, k-2) p comb(n*m-2, k-2) comb n*m-2 n*m n m 2 k-2 k 2 ans = 0 ans 0 for i in range(1,n):
    ans += i * (n-i) * m * m * p
    ans %= MOD i range(1,n) range 1 n ans += i * (n-i) * m * m * p ans i * (n-i) * m * m * p i * (n-i) * m * m i * (n-i) * m i * (n-i) i n-i n i m m p ans %= MOD ans MOD for i in range(1,m):
    ans += i * (m-i) * n * n * p
    ans %= MOD i range(1,m) range 1 m ans += i * (m-i) * n * n * p ans i * (m-i) * n * n * p i * (m-i) * n * n i * (m-i) * n i * (m-i) i m-i m i n n p ans %= MOD ans MOD print(ans) print ans r = r * i % MOD r * i % MOD r ans %= MOD MOD ans r = r * i % MOD r * i % MOD r m,k = map(int,input().split()) map(int,input().split()) m MOD = 10**9 + 7 10**9 + 7 MOD p = comb(n*m-2, k-2) comb(n*m-2, k-2) p r = pow(fact[N], MOD-2, MOD) pow(fact[N], MOD-2, MOD) r ans = 0 0 ans ans += i * (n-i) * m * m * p i * (n-i) * m * m * p ans ans += i * (m-i) * n * n * p i * (m-i) * n * n * p ans N = 10**6 + 10 10**6 + 10 N fact = [1]*(N+1) [1]*(N+1) fact n,m,k = map(int,input().split()) map(int,input().split()) n rfact = [1]*(N+1) [1]*(N+1) rfact ans %= MOD MOD ans k = map(int,input().split()) map(int,input().split()) k def perm(n, k):
  return fact[n] * rfact[n-k] % MOD

# nCk (mod MOD) を求める def perm(n, k):
  return fact[n] * rfact[n-k] % MOD

# nCk (mod MOD) を求める perm 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
MOD = 10**9 + 7
N = 10**6 + 10

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

# nPk (mod MOD) を求める
def perm(n, k):
  return fact[n] * rfact[n-k] % MOD

# nCk (mod MOD) を求める
def comb(n, k):
  return fact[n] * rfact[k] * rfact[n-k] % MOD

n,m,k = map(int,input().split())

p = comb(n*m-2, k-2)

ans = 0
for i in range(1,n):
    ans += i * (n-i) * m * m * p
    ans %= MOD

for i in range(1,m):
    ans += i * (m-i) * n * n * p
    ans %= MOD

print(ans)