# -*- coding: utf-8 -*-
mod = 10 ** 9 + 7
n, m, k = map(int, input().split())
nm = n * m
fact = [1] * (nm + 1)

for i in range(1, nm + 1):
    fact[i] = fact[i - 1] * i % mod


def C(n, k):
    x = fact[n]
    x *= pow(fact[n-k], mod - 2, mod)
    x %= mod
    x *= pow(fact[k], mod - 2, mod)
    x %= mod
    return x


def F(x):
    s1 = x * x * (x + 1) // 2
    s2 = x * (x + 1) * (2 * x + 1) // 6
    return (s1 - s2) % mod


res = (m ** 2 % mod * F(n) % mod + n ** 2 * F(m) % mod) % mod
res *= C(n * m - 2, k - 2)
res %= mod
print(res) mod = 10 ** 9 + 7 mod 10 ** 9 + 7 10 ** 9 10 9 7 n, m, k = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split m k nm = n * m nm n * m n m fact = [1] * (nm + 1) fact [1] * (nm + 1) [1] 1 nm + 1 nm 1 for i in range(1, nm + 1):
    fact[i] = fact[i - 1] * i % mod i range(1, nm + 1) range 1 nm + 1 nm 1 fact[i] = fact[i - 1] * i % mod fact[i] fact i fact[i - 1] * i % mod fact[i - 1] * i fact[i - 1] fact i - 1 i 1 i mod def C(n, k):
    x = fact[n]
    x *= pow(fact[n-k], mod - 2, mod)
    x %= mod
    x *= pow(fact[k], mod - 2, mod)
    x %= mod
    return x C x = fact[n] x fact[n] fact n x *= pow(fact[n-k], mod - 2, mod) x pow(fact[n-k], mod - 2, mod) pow fact[n-k] fact n-k n k mod - 2 mod 2 mod x %= mod x mod x *= pow(fact[k], mod - 2, mod) x pow(fact[k], mod - 2, mod) pow fact[k] fact k mod - 2 mod 2 mod x %= mod x mod return x x n n k k def F(x):
    s1 = x * x * (x + 1) // 2
    s2 = x * (x + 1) * (2 * x + 1) // 6
    return (s1 - s2) % mod F s1 = x * x * (x + 1) // 2 s1 x * x * (x + 1) // 2 x * x * (x + 1) x * x x x x + 1 x 1 2 s2 = x * (x + 1) * (2 * x + 1) // 6 s2 x * (x + 1) * (2 * x + 1) // 6 x * (x + 1) * (2 * x + 1) x * (x + 1) x x + 1 x 1 2 * x + 1 2 * x 2 x 1 6 return (s1 - s2) % mod (s1 - s2) % mod s1 - s2 s1 s2 mod x x res = (m ** 2 % mod * F(n) % mod + n ** 2 * F(m) % mod) % mod res (m ** 2 % mod * F(n) % mod + n ** 2 * F(m) % mod) % mod m ** 2 % mod * F(n) % mod + n ** 2 * F(m) % mod m ** 2 % mod * F(n) % mod m ** 2 % mod * F(n) m ** 2 % mod m ** 2 m 2 mod F(n) F n mod n ** 2 * F(m) % mod n ** 2 * F(m) n ** 2 n 2 F(m) F m mod mod res *= C(n * m - 2, k - 2) res C(n * m - 2, k - 2) C n * m - 2 n * m n m 2 k - 2 k 2 res %= mod res mod print(res) print res res = (m ** 2 % mod * F(n) % mod + n ** 2 * F(m) % mod) % mod (m ** 2 % mod * F(n) % mod + n ** 2 * F(m) % mod) % mod res def C(n, k):
    x = fact[n]
    x *= pow(fact[n-k], mod - 2, mod)
    x %= mod
    x *= pow(fact[k], mod - 2, mod)
    x %= mod
    return x def C(n, k):
    x = fact[n]
    x *= pow(fact[n-k], mod - 2, mod)
    x %= mod
    x *= pow(fact[k], mod - 2, mod)
    x %= mod
    return x C m, k = map(int, input().split()) map(int, input().split()) m fact = [1] * (nm + 1) [1] * (nm + 1) fact def F(x):
    s1 = x * x * (x + 1) // 2
    s2 = x * (x + 1) * (2 * x + 1) // 6
    return (s1 - s2) % mod def F(x):
    s1 = x * x * (x + 1) // 2
    s2 = x * (x + 1) * (2 * x + 1) // 6
    return (s1 - s2) % mod F res *= C(n * m - 2, k - 2) C(n * m - 2, k - 2) res k = map(int, input().split()) map(int, input().split()) k nm = n * m n * m nm res %= mod mod res mod = 10 ** 9 + 7 10 ** 9 + 7 mod n, m, k = map(int, input().split()) map(int, input().split()) n
# -*- coding: utf-8 -*-
mod = 10 ** 9 + 7
n, m, k = map(int, input().split())
nm = n * m
fact = [1] * (nm + 1)

for i in range(1, nm + 1):
    fact[i] = fact[i - 1] * i % mod


def C(n, k):
    x = fact[n]
    x *= pow(fact[n-k], mod - 2, mod)
    x %= mod
    x *= pow(fact[k], mod - 2, mod)
    x %= mod
    return x


def F(x):
    s1 = x * x * (x + 1) // 2
    s2 = x * (x + 1) * (2 * x + 1) // 6
    return (s1 - s2) % mod


res = (m ** 2 % mod * F(n) % mod + n ** 2 * F(m) % mod) % mod
res *= C(n * m - 2, k - 2)
res %= mod
print(res)
