#N=gets.to_i
#S=gets.chomp
#A=(0...N).map{gets.to_i}
#sum=A.inject(&:+)
#B=gets.split.map(&:to_i)
 
 
N,M,K=gets.split.map(&:to_i)

MOD=10**9+7

def sumrange(i) # from 0 to max value
  return (i*(i+1)/2)%MOD
end

def hoge(n)
  return (n*(n-1)*(n+1)/6)%MOD
end
def fact(i)
  return 1 if i==0
  (fact(i-1)*i)%MOD
end
def combination(n,m)
  return fact(n)*fact(m).pow(MOD-2,MOD)*fact(n-m).pow(MOD-2,MOD)%MOD
end

puts (N*N*hoge(M)+M*M*hoge(N))*combination(N*M-2,K-2)%MOD

