def comb(n, k, p):
    """power_funcを用いて(nCk) mod p を求める"""
    from math import factorial
    if n < 0 or k < 0 or n < k: return 0
    if n == 0 or k == 0: return 1
    a = factorial(n) % p
    b = factorial(k) % p
    c = factorial(n - k) % p
    return (a * power_func(b, p - 2, p) * power_func(c, p - 2, p)) % p


def power_func(a, b, p):
    """a^b mod p を求める"""
    if b == 0: return 1
    if b % 2 == 0:
        d = power_func(a, b // 2, p)
        return d * d % p
    if b % 2 == 1:
        return (a * power_func(a, b - 1, p)) % p


N, M, K = map(int, input().split())
mod = 10 ** 9 + 7
c = comb(N * M - 2, K - 2, mod)

sumx = 0
for d in range(1, M + 1):
    sumx += d * (M - d)
    sumx %= mod
sumx *= N
sumx %= mod
sumx *= N
sumx %= mod

sumy = 0
for d in range(1, N + 1):
    sumy += d * (N - d)
    sumy %= mod
sumy *= M
sumy %= mod
sumy *= M
sumy %= mod

ans = (((sumx + sumy) % mod) * c) % mod
print(ans)

 def comb(n, k, p):
    """power_funcを用いて(nCk) mod p を求める"""
    from math import factorial
    if n < 0 or k < 0 or n < k: return 0
    if n == 0 or k == 0: return 1
    a = factorial(n) % p
    b = factorial(k) % p
    c = factorial(n - k) % p
    return (a * power_func(b, p - 2, p) * power_func(c, p - 2, p)) % p comb """power_funcを用いて(nCk) mod p を求める""" from math import factorial if n < 0 or k < 0 or n < k: return 0
     n < 0 or k < 0 or n < k n < 0 or k < 0 n < 0 n 0 k < 0 k 0 n < k n k if n == 0 or k == 0: return 1
     n == 0 or k == 0 n == 0 n 0 k == 0 k 0 a = factorial(n) % p a factorial(n) % p factorial(n) factorial n p b = factorial(k) % p b factorial(k) % p factorial(k) factorial k p c = factorial(n - k) % p c factorial(n - k) % p factorial(n - k) factorial n - k n k p return (a * power_func(b, p - 2, p) * power_func(c, p - 2, p)) % p (a * power_func(b, p - 2, p) * power_func(c, p - 2, p)) % p a * power_func(b, p - 2, p) * power_func(c, p - 2, p) a * power_func(b, p - 2, p) a power_func(b, p - 2, p) power_func b p - 2 p 2 p power_func(c, p - 2, p) power_func c p - 2 p 2 p p n n k k p p def power_func(a, b, p):
    """a^b mod p を求める"""
    if b == 0: return 1
    if b % 2 == 0:
        d = power_func(a, b // 2, p)
        return d * d % p
    if b % 2 == 1:
        return (a * power_func(a, b - 1, p)) % p power_func """a^b mod p を求める""" if b == 0: return 1
     b == 0 b 0 if b % 2 == 0:
        d = power_func(a, b // 2, p)
        return d * d % p
     b % 2 == 0 b % 2 b 2 0 d = power_func(a, b // 2, p) d power_func(a, b // 2, p) power_func a b // 2 b 2 p return d * d % p d * d % p d * d d d p if b % 2 == 1:
        return (a * power_func(a, b - 1, p)) % p b % 2 == 1 b % 2 b 2 1 return (a * power_func(a, b - 1, p)) % p (a * power_func(a, b - 1, p)) % p a * power_func(a, b - 1, p) a power_func(a, b - 1, p) power_func a b - 1 b 1 p p a a b b p p N, M, K = map(int, input().split()) N map(int, input().split()) map int input().split() ().split () input split M K mod = 10 ** 9 + 7 mod 10 ** 9 + 7 10 ** 9 10 9 7 c = comb(N * M - 2, K - 2, mod) c comb(N * M - 2, K - 2, mod) comb N * M - 2 N * M N M 2 K - 2 K 2 mod sumx = 0 sumx 0 for d in range(1, M + 1):
    sumx += d * (M - d)
    sumx %= mod d range(1, M + 1) range 1 M + 1 M 1 sumx += d * (M - d) sumx d * (M - d) d M - d M d sumx %= mod sumx mod sumx *= N sumx N sumx %= mod sumx mod sumx *= N sumx N sumx %= mod sumx mod sumy = 0 sumy 0 for d in range(1, N + 1):
    sumy += d * (N - d)
    sumy %= mod d range(1, N + 1) range 1 N + 1 N 1 sumy += d * (N - d) sumy d * (N - d) d N - d N d sumy %= mod sumy mod sumy *= M sumy M sumy %= mod sumy mod sumy *= M sumy M sumy %= mod sumy mod ans = (((sumx + sumy) % mod) * c) % mod ans (((sumx + sumy) % mod) * c) % mod ((sumx + sumy) % mod) * c (sumx + sumy) % mod sumx + sumy sumx sumy mod c mod print(ans) print ans def comb(n, k, p):
    """power_funcを用いて(nCk) mod p を求める"""
    from math import factorial
    if n < 0 or k < 0 or n < k: return 0
    if n == 0 or k == 0: return 1
    a = factorial(n) % p
    b = factorial(k) % p
    c = factorial(n - k) % p
    return (a * power_func(b, p - 2, p) * power_func(c, p - 2, p)) % p def comb(n, k, p):
    """power_funcを用いて(nCk) mod p を求める"""
    from math import factorial
    if n < 0 or k < 0 or n < k: return 0
    if n == 0 or k == 0: return 1
    a = factorial(n) % p
    b = factorial(k) % p
    c = factorial(n - k) % p
    return (a * power_func(b, p - 2, p) * power_func(c, p - 2, p)) % p comb K = map(int, input().split()) map(int, input().split()) K sumx %= mod mod sumx sumy %= mod mod sumy N, M, K = map(int, input().split()) map(int, input().split()) N sumy += d * (N - d) d * (N - d) sumy sumy *= M M sumy sumy = 0 0 sumy sumy %= mod mod sumy sumx %= mod mod sumx sumx *= N N sumx def power_func(a, b, p):
    """a^b mod p を求める"""
    if b == 0: return 1
    if b % 2 == 0:
        d = power_func(a, b // 2, p)
        return d * d % p
    if b % 2 == 1:
        return (a * power_func(a, b - 1, p)) % p def power_func(a, b, p):
    """a^b mod p を求める"""
    if b == 0: return 1
    if b % 2 == 0:
        d = power_func(a, b // 2, p)
        return d * d % p
    if b % 2 == 1:
        return (a * power_func(a, b - 1, p)) % p power_func sumx *= N N sumx ans = (((sumx + sumy) % mod) * c) % mod (((sumx + sumy) % mod) * c) % mod ans c = comb(N * M - 2, K - 2, mod) comb(N * M - 2, K - 2, mod) c sumx += d * (M - d) d * (M - d) sumx sumx %= mod mod sumx sumy *= M M sumy sumx = 0 0 sumx sumy %= mod mod sumy M, K = map(int, input().split()) map(int, input().split()) M mod = 10 ** 9 + 7 10 ** 9 + 7 mod
def comb(n, k, p):
    """power_funcを用いて(nCk) mod p を求める"""
    from math import factorial
    if n < 0 or k < 0 or n < k: return 0
    if n == 0 or k == 0: return 1
    a = factorial(n) % p
    b = factorial(k) % p
    c = factorial(n - k) % p
    return (a * power_func(b, p - 2, p) * power_func(c, p - 2, p)) % p


def power_func(a, b, p):
    """a^b mod p を求める"""
    if b == 0: return 1
    if b % 2 == 0:
        d = power_func(a, b // 2, p)
        return d * d % p
    if b % 2 == 1:
        return (a * power_func(a, b - 1, p)) % p


N, M, K = map(int, input().split())
mod = 10 ** 9 + 7
c = comb(N * M - 2, K - 2, mod)

sumx = 0
for d in range(1, M + 1):
    sumx += d * (M - d)
    sumx %= mod
sumx *= N
sumx %= mod
sumx *= N
sumx %= mod

sumy = 0
for d in range(1, N + 1):
    sumy += d * (N - d)
    sumy %= mod
sumy *= M
sumy %= mod
sumy *= M
sumy %= mod

ans = (((sumx + sumy) % mod) * c) % mod
print(ans)


