N,M,K=gets.split.map(&:to_i)
MOD=1000000007

def xsum
  sum=0
  (N-1).times do |i|
    i+=1
    sum+=(i*(N-i)*M*M) % MOD
  end
  return sum
end

def ysum
  sum=0
  (M-1).times do |i|
    i+=1
    sum+=(i*(M-i)*N*N) % MOD
  end
  return sum
end

def comb(n, k)
  def mpow(x, n)
    ret = 1
    while n > 0
      if n.even?
        x = x * x % MOD
        n >>= 1
      else
        ret = ret * x % MOD
        n -= 1
      end
    end
    return ret
  end
  k = k < n-k ? k : n-k
  return (n-k+1..n).inject(1){|p, q| p*q % MOD} * mpow((1 .. k).inject(1){|p, q| p*q % MOD}, MOD - 2)
end
puts ((xsum+ysum)*comb(N*M-2,K-2)) % MOD
