mod = 10 ** 9 + 7
MAX = 2 * 10 ** 5

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

inv = [1] * (MAX + 1)
for i in range(2, MAX + 1):
    inv[i] = inv[mod % i] * (mod - mod // i) % mod

fact_inv = [1] * (MAX + 1)
for i in range(1, MAX + 1):
    fact_inv[i] = fact_inv[i-1] * inv[i] % mod


def comb(n, k):
    if n < k:
        return 0
    return fact[n] * fact_inv[n-k] * fact_inv[k] % mod


n, m, k = map(int, input().split())

ans = 0
cmb = comb(m * n - 2, k - 2)
for i in range(1, m):
    ans += i * (m - i) * n * n * cmb
    ans %= mod

for i in range(1, n):
    ans += i * m * m * (n - i) * cmb
    ans %= mod

print(ans) mod = 10 ** 9 + 7 mod 10 ** 9 + 7 10 ** 9 10 9 7 MAX = 2 * 10 ** 5 MAX 2 * 10 ** 5 2 10 ** 5 10 5 fact = [1] * (MAX + 1) fact [1] * (MAX + 1) [1] 1 MAX + 1 MAX 1 for i in range(1, MAX + 1):
    fact[i] = (fact[i-1] * i) % mod i range(1, MAX + 1) range 1 MAX + 1 MAX 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 inv = [1] * (MAX + 1) inv [1] * (MAX + 1) [1] 1 MAX + 1 MAX 1 for i in range(2, MAX + 1):
    inv[i] = inv[mod % i] * (mod - mod // i) % mod i range(2, MAX + 1) range 2 MAX + 1 MAX 1 inv[i] = inv[mod % i] * (mod - mod // i) % mod inv[i] inv i inv[mod % i] * (mod - mod // i) % mod inv[mod % i] * (mod - mod // i) inv[mod % i] inv mod % i mod i mod - mod // i mod mod // i mod i mod fact_inv = [1] * (MAX + 1) fact_inv [1] * (MAX + 1) [1] 1 MAX + 1 MAX 1 for i in range(1, MAX + 1):
    fact_inv[i] = fact_inv[i-1] * inv[i] % mod i range(1, MAX + 1) range 1 MAX + 1 MAX 1 fact_inv[i] = fact_inv[i-1] * inv[i] % mod fact_inv[i] fact_inv i fact_inv[i-1] * inv[i] % mod fact_inv[i-1] * inv[i] fact_inv[i-1] fact_inv i-1 i 1 inv[i] inv i mod def comb(n, k):
    if n < k:
        return 0
    return fact[n] * fact_inv[n-k] * fact_inv[k] % mod comb if n < k:
        return 0
     n < k n k return 0 0 return fact[n] * fact_inv[n-k] * fact_inv[k] % mod fact[n] * fact_inv[n-k] * fact_inv[k] % mod fact[n] * fact_inv[n-k] * fact_inv[k] fact[n] * fact_inv[n-k] fact[n] fact n fact_inv[n-k] fact_inv n-k n k fact_inv[k] fact_inv k mod n n k k n, m, k = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split m k ans = 0 ans 0 cmb = comb(m * n - 2, k - 2) cmb comb(m * n - 2, k - 2) comb m * n - 2 m * n m n 2 k - 2 k 2 for i in range(1, m):
    ans += i * (m - i) * n * n * cmb
    ans %= mod i range(1, m) range 1 m ans += i * (m - i) * n * n * cmb ans i * (m - i) * n * n * cmb i * (m - i) * n * n i * (m - i) * n i * (m - i) i m - i m i n n cmb ans %= mod ans mod for i in range(1, n):
    ans += i * m * m * (n - i) * cmb
    ans %= mod i range(1, n) range 1 n ans += i * m * m * (n - i) * cmb ans i * m * m * (n - i) * cmb i * m * m * (n - i) i * m * m i * m i m m n - i n i cmb ans %= mod ans mod print(ans) print ans cmb = comb(m * n - 2, k - 2) comb(m * n - 2, k - 2) cmb fact = [1] * (MAX + 1) [1] * (MAX + 1) fact MAX = 2 * 10 ** 5 2 * 10 ** 5 MAX mod = 10 ** 9 + 7 10 ** 9 + 7 mod m, k = map(int, input().split()) map(int, input().split()) m fact_inv = [1] * (MAX + 1) [1] * (MAX + 1) fact_inv inv = [1] * (MAX + 1) [1] * (MAX + 1) inv ans = 0 0 ans ans %= mod mod ans def comb(n, k):
    if n < k:
        return 0
    return fact[n] * fact_inv[n-k] * fact_inv[k] % mod def comb(n, k):
    if n < k:
        return 0
    return fact[n] * fact_inv[n-k] * fact_inv[k] % mod comb ans += i * m * m * (n - i) * cmb i * m * m * (n - i) * cmb ans ans %= mod mod ans k = map(int, input().split()) map(int, input().split()) k ans += i * (m - i) * n * n * cmb i * (m - i) * n * n * cmb ans n, m, k = map(int, input().split()) map(int, input().split()) n
mod = 10 ** 9 + 7
MAX = 2 * 10 ** 5

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

inv = [1] * (MAX + 1)
for i in range(2, MAX + 1):
    inv[i] = inv[mod % i] * (mod - mod // i) % mod

fact_inv = [1] * (MAX + 1)
for i in range(1, MAX + 1):
    fact_inv[i] = fact_inv[i-1] * inv[i] % mod


def comb(n, k):
    if n < k:
        return 0
    return fact[n] * fact_inv[n-k] * fact_inv[k] % mod


n, m, k = map(int, input().split())

ans = 0
cmb = comb(m * n - 2, k - 2)
for i in range(1, m):
    ans += i * (m - i) * n * n * cmb
    ans %= mod

for i in range(1, n):
    ans += i * m * m * (n - i) * cmb
    ans %= mod

print(ans)
