BASE = 1000000007


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

  for i in 1..r
    ans = div(ans, i)
  end

  return ans
end

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

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

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

def add(a, b)
  (a + b) % BASE
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 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)
