h, w, k = readline.split.map(&:to_i)
MOD = 1000000007

oy = (1...w).map{|i|(w-i)*i}.reduce(&:+) % MOD
oy = h*h * oy % MOD

ox = (1...h).map{|i| (h-i)*i}.reduce(&:+) % MOD
ox = w*w * ox % MOD

#a = p (0...h).flat_map{|x| (0...w).map{|y| [x,y]}}.combination(2).to_a
#p a.map{|((x1, y1),(x2,y2))| (x1-x2).abs}.reduce(&:+)
#p a.map{|((x1, y1),(x2,y2))| (y1-y2).abs}.reduce(&:+)

n = w * h
FACT = Array.new(n+1){1}
INV = Array.new(n+1){1}
FINV = Array.new(n+1){1}

(2..n).each{|i|
  FACT[i] = FACT[i-1] * i % MOD
  INV[i] = MOD - INV[MOD % i] * (MOD / i) % MOD
  FINV[i] = FINV[i-1] * INV[i] % MOD
}

def ncr n, r
  return 0 if n < r or n < 0 or r < 0
  return FACT[n] * FINV[r] * FINV[n - r] % MOD
end

al = oy + ox
als = ncr(h*w-2, k-2) * al % MOD
p als