import math
N,M,K=map(int,input().split())
mod=10**9+7
ans=0
for i in range(1,N):
  l=(N+1-i)*(N-i)//2%mod 
  ans+=l*M*M
  ans%mod
for i in range(1,M):
  l=(M+1-i)*(M-i)//2%mod 
  ans+=l*N*N
  ans%mod
  
def c_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
                                 
ans*=c_count(M*N-2,K-2)%mod
print(ans%mod) import math math 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 ans=0 ans 0 for i in range(1,N):
  l=(N+1-i)*(N-i)//2%mod 
  ans+=l*M*M
  ans%mod i range(1,N) range 1 N l=(N+1-i)*(N-i)//2%mod l (N+1-i)*(N-i)//2%mod (N+1-i)*(N-i)//2 (N+1-i)*(N-i) N+1-i N+1 N 1 i N-i N i 2 mod ans+=l*M*M ans l*M*M l*M l M M ans%mod ans mod for i in range(1,M):
  l=(M+1-i)*(M-i)//2%mod 
  ans+=l*N*N
  ans%mod
   i range(1,M) range 1 M l=(M+1-i)*(M-i)//2%mod l (M+1-i)*(M-i)//2%mod (M+1-i)*(M-i)//2 (M+1-i)*(M-i) M+1-i M+1 M 1 i M-i M i 2 mod ans+=l*N*N ans l*N*N l*N l N N ans%mod ans mod def c_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
                                  c_count return math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) math.factorial(n) math.factorial math factorial n math.factorial(n - r) * math.factorial(r) math.factorial(n - r) math.factorial math factorial n - r n r math.factorial(r) math.factorial math factorial r n n r r ans*=c_count(M*N-2,K-2)%mod ans c_count(M*N-2,K-2)%mod c_count(M*N-2,K-2) c_count M*N-2 M*N M N 2 K-2 K 2 mod print(ans%mod) print ans%mod ans mod ans+=l*M*M l*M*M ans l=(M+1-i)*(M-i)//2%mod (M+1-i)*(M-i)//2%mod l ans=0 0 ans l=(N+1-i)*(N-i)//2%mod (N+1-i)*(N-i)//2%mod l M,K=map(int,input().split()) map(int,input().split()) M mod=10**9+7 10**9+7 mod K=map(int,input().split()) map(int,input().split()) K def c_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
                                  def c_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
                                  c_count ans*=c_count(M*N-2,K-2)%mod c_count(M*N-2,K-2)%mod ans N,M,K=map(int,input().split()) map(int,input().split()) N ans+=l*N*N l*N*N ans
import math
N,M,K=map(int,input().split())
mod=10**9+7
ans=0
for i in range(1,N):
  l=(N+1-i)*(N-i)//2%mod 
  ans+=l*M*M
  ans%mod
for i in range(1,M):
  l=(M+1-i)*(M-i)//2%mod 
  ans+=l*N*N
  ans%mod
  
def c_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
                                 
ans*=c_count(M*N-2,K-2)%mod
print(ans%mod)