n, m, k = map(int, input().split())
mod = 10**9 + 7
cum_n = 0
t = 0
for i in range(1, n):
  t += i
  cum_n += t

cum_m = 0
t = 0
for i in range(1, m):
  t += i
  cum_m += t

ans = (cum_n * m**2 + cum_m * n**2) % mod

def nCr(n,r,mod = 10**9+7):
    r = min(n-r,r)
    numer = denom = 1
    for i in range(1,r+1):
        numer = numer * (n+1-i) %mod
        denom = denom * i % mod
    return numer * pow(denom,mod-2,mod) %mod

if n*m-2 == 0:
  p = 1
else:
  p = nCr(n*m-2, k-2)

ans = (ans*p)%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 cum_n = 0 cum_n 0 t = 0 t 0 for i in range(1, n):
  t += i
  cum_n += t i range(1, n) range 1 n t += i t i cum_n += t cum_n t cum_m = 0 cum_m 0 t = 0 t 0 for i in range(1, m):
  t += i
  cum_m += t i range(1, m) range 1 m t += i t i cum_m += t cum_m t ans = (cum_n * m**2 + cum_m * n**2) % mod ans (cum_n * m**2 + cum_m * n**2) % mod cum_n * m**2 + cum_m * n**2 cum_n * m**2 cum_n m**2 m 2 cum_m * n**2 cum_m n**2 n 2 mod def nCr(n,r,mod = 10**9+7):
    r = min(n-r,r)
    numer = denom = 1
    for i in range(1,r+1):
        numer = numer * (n+1-i) %mod
        denom = denom * i % mod
    return numer * pow(denom,mod-2,mod) %mod nCr r = min(n-r,r) r min(n-r,r) min n-r n r r numer = denom = 1 numer 1 = denom = 1 denom 1 for i in range(1,r+1):
        numer = numer * (n+1-i) %mod
        denom = denom * i % mod
     i range(1,r+1) range 1 r+1 r 1 numer = numer * (n+1-i) %mod numer numer * (n+1-i) %mod numer * (n+1-i) numer n+1-i n+1 n 1 i mod denom = denom * i % mod denom denom * i % mod denom * i denom i mod return numer * pow(denom,mod-2,mod) %mod numer * pow(denom,mod-2,mod) %mod numer * pow(denom,mod-2,mod) numer pow(denom,mod-2,mod) pow denom mod-2 mod 2 mod mod n n r r mod = 10**9+7 mod 10**9+7 10**9 10 9 7 if n*m-2 == 0:
  p = 1
else:
  p = nCr(n*m-2, k-2) n*m-2 == 0 n*m-2 n*m n m 2 0 p = 1 p 1 p = nCr(n*m-2, k-2) p nCr(n*m-2, k-2) nCr n*m-2 n*m n m 2 k-2 k 2 ans = (ans*p)%mod ans (ans*p)%mod ans*p ans p mod print(ans) print ans ans = (cum_n * m**2 + cum_m * n**2) % mod (cum_n * m**2 + cum_m * n**2) % mod ans cum_m = 0 0 cum_m n, m, k = map(int, input().split()) map(int, input().split()) n p = nCr(n*m-2, k-2) nCr(n*m-2, k-2) p cum_n = 0 0 cum_n cum_n += t t cum_n p = 1 1 p def nCr(n,r,mod = 10**9+7):
    r = min(n-r,r)
    numer = denom = 1
    for i in range(1,r+1):
        numer = numer * (n+1-i) %mod
        denom = denom * i % mod
    return numer * pow(denom,mod-2,mod) %mod def nCr(n,r,mod = 10**9+7):
    r = min(n-r,r)
    numer = denom = 1
    for i in range(1,r+1):
        numer = numer * (n+1-i) %mod
        denom = denom * i % mod
    return numer * pow(denom,mod-2,mod) %mod nCr mod = 10**9 + 7 10**9 + 7 mod ans = (ans*p)%mod (ans*p)%mod ans m, k = map(int, input().split()) map(int, input().split()) m k = map(int, input().split()) map(int, input().split()) k cum_m += t t cum_m t += i i t t = 0 0 t t = 0 0 t t += i i t
n, m, k = map(int, input().split())
mod = 10**9 + 7
cum_n = 0
t = 0
for i in range(1, n):
  t += i
  cum_n += t

cum_m = 0
t = 0
for i in range(1, m):
  t += i
  cum_m += t

ans = (cum_n * m**2 + cum_m * n**2) % mod

def nCr(n,r,mod = 10**9+7):
    r = min(n-r,r)
    numer = denom = 1
    for i in range(1,r+1):
        numer = numer * (n+1-i) %mod
        denom = denom * i % mod
    return numer * pow(denom,mod-2,mod) %mod

if n*m-2 == 0:
  p = 1
else:
  p = nCr(n*m-2, k-2)

ans = (ans*p)%mod
print(ans)