# coding: cp932
MOD = 1000000007

def prepare(n)
  # n! の計算
  f = 1
  for m in 1..n
    f = mul(f, m)
  end

  fn = f
     
  # n!^-1 の計算
  inv = power(f, MOD - 2)

  # n!^-1 - 1!^-1 の計算
  invs = [1] * (n + 1)
  invs[n] = inv
  n.downto(1) do |m|
    inv = mul(inv, m)
    invs[m - 1] = inv
  end
     
  return [fn, invs]
end

def nCr(n,r)
  fn, invs = prepare(n)

  ans = fn
  #for i in (n-r+1)..n
  #  ans = mul(ans, i)
  #end

  ans = mul(ans, invs[r])
  ans = mul(ans, invs[n-r])
  #for i in 1..r
  #  ans = div(ans, i)
  #end

  return ans
end

def mul(a, b)
    return ((a % MOD) * (b % MOD)) % MOD
end

def power(x, y)
  if y == 0
  	1
  elsif y == 1
    x % MOD
  elsif y % 2 == 0
    power(x, y/2)**2 % MOD
  else
    power(x, y/2)**2 * x % MOD
  end
end

def div(a, b)
  mul(a, power(b, MOD-2))
end

def add(a, b)
  (a + b) % MOD
end

def manhattan(n1, m1, n2, m2)
  add((n1-n2).abs, (m1-m2).abs)
end

# puts nCr(100, 7)

N, M, K = readline.split(' ').map(&:to_i)

NM = N*M

# sum_(i,j) combination(n-2, k-2) * manhattan(i,j)
weight = nCr(NM-2, K-2)

sum = 0
for n in 0...N
  rowsum = mul(
    div(
      add(div(mul(M-1, M),2),
          div(mul(mul(M-1, M), 2*M-1), 6)),
      2),
    N)

  lhssum = div(mul(n, n+1), 2)
  rhssum = div(mul(N-n-1, N-n), 2)

  lrsum = mul(add(lhssum, rhssum), div(mul(M-1, M), 2))

  sum = add(sum, mul(rhssum, M))
  sum = add(sum, lrsum)
  sum = add(sum, rowsum)

  # $stderr.printf("sum=%d, lhssum=%d, rhssum=%d, rowsum=%d\n", sum, lhssum, rhssum, rowsum)
end


# for m in 0...M
#   for n in 0...N
#     rhssum = div(mul(N-n-1, N-n), 2)
#     lhssum = div(mul(n, n+1), 2)
#     rowsum = mul(div(mul(M-m-1, M-m), 2), N)
#     # $stderr.printf("m=%d, n=%d, rhssum=%d, lhssum=%d, rowsum=%d\n", m, n, rhssum, lhssum, rowsum)

#     sum = add(sum, rowsum)
#     sum = add(sum, mul(rhssum, M-m))
#     sum = add(sum, mul(lhssum, M-m-1))
#   end
# end

# for i in 0...NM
#   ni = i % M
#   mi = i / M
#   for j in i...NM
#     nj = j % M
#     mj = j / M
#     sum = add(sum, manhattan(ni, mi, nj, mj))
#   end
# end

puts mul(sum, weight)
