let rec for_fold a b v f = if a > b then v else for_fold (a+1) b (f a v) f

let modulo = 1000000007
let (+@) a b = (a + b) mod modulo
let ( *@) a b = (a * b) mod modulo
let rec modpow a n =
   if n = 0 then 1
   else if n mod 2 = 1 then a *@ (modpow a (n-1))
   else let h = modpow a (n/2) in h *@ h
let modinv a = modpow a (modulo - 2)

let fact =
   let ret = Array.init 200001 (max 1) in
   for i = 2 to 200000 do
      ret.(i) <- i *@ ret.(i-1);
   done;
   ret

let comb n k = fact.(n) *@ modinv fact.(k) *@ modinv fact.(n-k)

let () =
   Scanf.scanf "%d %d %d" @@ fun n m k ->
   let calc x y =
      comb (x*y-2) (k-2) *@ for_fold 1 (x-1) 0 (fun i s -> s +@ i *@ (x-i) *@ y *@ y)
   in
   calc n m +@ calc m n |> Printf.printf "%d\n"
