n,m,k = map(int, input().split())
n_ = n*m
mod = 10**9+7
fun = [1]*(n_+1)
for i in range(1,n_+1):
    fun[i] = fun[i-1]*i%mod
rev = [1]*(n_+1)
rev[n_] = pow(fun[n_],mod-2,mod)
for i in range(n_-1,0,-1):
    rev[i] = rev[i+1]*(i+1)%mod

def nCr(n,r):
    if r > n:
        return 0
    return fun[n]*rev[r]%mod*rev[n-r]%mod
  
x = sum(i*(n-i) for i in range(n))%mod
y = sum(i*(m-i) for i in range(m))%mod
ans = (x*m**2 + y*n**2)%mod*nCr(n*m-2,k-2)%mod
print(ans) n,m,k = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split m k n_ = n*m n_ n*m n m mod = 10**9+7 mod 10**9+7 10**9 10 9 7 fun = [1]*(n_+1) fun [1]*(n_+1) [1] 1 n_+1 n_ 1 for i in range(1,n_+1):
    fun[i] = fun[i-1]*i%mod i range(1,n_+1) range 1 n_+1 n_ 1 fun[i] = fun[i-1]*i%mod fun[i] fun i fun[i-1]*i%mod fun[i-1]*i fun[i-1] fun i-1 i 1 i mod rev = [1]*(n_+1) rev [1]*(n_+1) [1] 1 n_+1 n_ 1 rev[n_] = pow(fun[n_],mod-2,mod) rev[n_] rev n_ pow(fun[n_],mod-2,mod) pow fun[n_] fun n_ mod-2 mod 2 mod for i in range(n_-1,0,-1):
    rev[i] = rev[i+1]*(i+1)%mod i range(n_-1,0,-1) range n_-1 n_ 1 0 -1 rev[i] = rev[i+1]*(i+1)%mod rev[i] rev i rev[i+1]*(i+1)%mod rev[i+1]*(i+1) rev[i+1] rev i+1 i 1 i+1 i 1 mod def nCr(n,r):
    if r > n:
        return 0
    return fun[n]*rev[r]%mod*rev[n-r]%mod
   nCr if r > n:
        return 0
     r > n r n return 0 0 return fun[n]*rev[r]%mod*rev[n-r]%mod fun[n]*rev[r]%mod*rev[n-r]%mod fun[n]*rev[r]%mod*rev[n-r] fun[n]*rev[r]%mod fun[n]*rev[r] fun[n] fun n rev[r] rev r mod rev[n-r] rev n-r n r mod n n r r x = sum(i*(n-i) for i in range(n))%mod x sum(i*(n-i) for i in range(n))%mod sum(i*(n-i) for i in range(n)) sum i*(n-i) i n-i n i mod y = sum(i*(m-i) for i in range(m))%mod y sum(i*(m-i) for i in range(m))%mod sum(i*(m-i) for i in range(m)) sum i*(m-i) i m-i m i mod ans = (x*m**2 + y*n**2)%mod*nCr(n*m-2,k-2)%mod ans (x*m**2 + y*n**2)%mod*nCr(n*m-2,k-2)%mod (x*m**2 + y*n**2)%mod*nCr(n*m-2,k-2) (x*m**2 + y*n**2)%mod x*m**2 + y*n**2 x*m**2 x m**2 m 2 y*n**2 y n**2 n 2 mod nCr(n*m-2,k-2) nCr n*m-2 n*m n m 2 k-2 k 2 mod print(ans) print ans m,k = map(int, input().split()) map(int, input().split()) m k = map(int, input().split()) map(int, input().split()) k n_ = n*m n*m n_ fun = [1]*(n_+1) [1]*(n_+1) fun x = sum(i*(n-i) for i in range(n))%mod sum(i*(n-i) for i in range(n))%mod x rev = [1]*(n_+1) [1]*(n_+1) rev n,m,k = map(int, input().split()) map(int, input().split()) n y = sum(i*(m-i) for i in range(m))%mod sum(i*(m-i) for i in range(m))%mod y mod = 10**9+7 10**9+7 mod def nCr(n,r):
    if r > n:
        return 0
    return fun[n]*rev[r]%mod*rev[n-r]%mod
   def nCr(n,r):
    if r > n:
        return 0
    return fun[n]*rev[r]%mod*rev[n-r]%mod
   nCr ans = (x*m**2 + y*n**2)%mod*nCr(n*m-2,k-2)%mod (x*m**2 + y*n**2)%mod*nCr(n*m-2,k-2)%mod ans
n,m,k = map(int, input().split())
n_ = n*m
mod = 10**9+7
fun = [1]*(n_+1)
for i in range(1,n_+1):
    fun[i] = fun[i-1]*i%mod
rev = [1]*(n_+1)
rev[n_] = pow(fun[n_],mod-2,mod)
for i in range(n_-1,0,-1):
    rev[i] = rev[i+1]*(i+1)%mod

def nCr(n,r):
    if r > n:
        return 0
    return fun[n]*rev[r]%mod*rev[n-r]%mod
  
x = sum(i*(n-i) for i in range(n))%mod
y = sum(i*(m-i) for i in range(m))%mod
ans = (x*m**2 + y*n**2)%mod*nCr(n*m-2,k-2)%mod
print(ans)