def sum_distance(a, b):
    x = 0
    for i in range(a):
        x += ((i + 1) * (a - i))
        x %= mod
    x *= pow(b, 2)
    return x % mod

def comb(n, r):
    x, y = 1, 1
    for i in range(n, n - r, -1):
        x *= i
        y *= i + r - n
        x %= mod
        y %= mod
    return pow(y, mod - 2, mod) * x % mod

n, m, k = map(int, input().split())
mod = pow(10, 9) + 7
ans = 0
ans += sum_distance(n - 1, m)
ans += sum_distance(m - 1, n)
ans %= mod
ans *= comb(n * m - 2, k - 2)
ans %= mod
print(ans) def sum_distance(a, b):
    x = 0
    for i in range(a):
        x += ((i + 1) * (a - i))
        x %= mod
    x *= pow(b, 2)
    return x % mod sum_distance x = 0 x 0 for i in range(a):
        x += ((i + 1) * (a - i))
        x %= mod
     i range(a) range a x += ((i + 1) * (a - i)) x (i + 1) * (a - i) i + 1 i 1 a - i a i x %= mod x mod x *= pow(b, 2) x pow(b, 2) pow b 2 return x % mod x % mod x mod a a b b def comb(n, r):
    x, y = 1, 1
    for i in range(n, n - r, -1):
        x *= i
        y *= i + r - n
        x %= mod
        y %= mod
    return pow(y, mod - 2, mod) * x % mod comb x, y = 1, 1 x 1 y 1 for i in range(n, n - r, -1):
        x *= i
        y *= i + r - n
        x %= mod
        y %= mod
     i range(n, n - r, -1) range n n - r n r -1 x *= i x i y *= i + r - n y i + r - n i + r i r n x %= mod x mod y %= mod y mod return pow(y, mod - 2, mod) * x % mod pow(y, mod - 2, mod) * x % mod pow(y, mod - 2, mod) * x pow(y, mod - 2, mod) pow y mod - 2 mod 2 mod x mod n n r r n, m, k = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split m k mod = pow(10, 9) + 7 mod pow(10, 9) + 7 pow(10, 9) pow 10 9 7 ans = 0 ans 0 ans += sum_distance(n - 1, m) ans sum_distance(n - 1, m) sum_distance n - 1 n 1 m ans += sum_distance(m - 1, n) ans sum_distance(m - 1, n) sum_distance m - 1 m 1 n ans %= mod ans mod ans *= comb(n * m - 2, k - 2) ans comb(n * m - 2, k - 2) comb n * m - 2 n * m n m 2 k - 2 k 2 ans %= mod ans mod print(ans) print ans ans %= mod mod ans ans += sum_distance(n - 1, m) sum_distance(n - 1, m) ans mod = pow(10, 9) + 7 pow(10, 9) + 7 mod ans = 0 0 ans ans %= mod mod ans def sum_distance(a, b):
    x = 0
    for i in range(a):
        x += ((i + 1) * (a - i))
        x %= mod
    x *= pow(b, 2)
    return x % mod def sum_distance(a, b):
    x = 0
    for i in range(a):
        x += ((i + 1) * (a - i))
        x %= mod
    x *= pow(b, 2)
    return x % mod sum_distance ans += sum_distance(m - 1, n) sum_distance(m - 1, n) ans k = map(int, input().split()) map(int, input().split()) k m, k = map(int, input().split()) map(int, input().split()) m def comb(n, r):
    x, y = 1, 1
    for i in range(n, n - r, -1):
        x *= i
        y *= i + r - n
        x %= mod
        y %= mod
    return pow(y, mod - 2, mod) * x % mod def comb(n, r):
    x, y = 1, 1
    for i in range(n, n - r, -1):
        x *= i
        y *= i + r - n
        x %= mod
        y %= mod
    return pow(y, mod - 2, mod) * x % mod comb n, m, k = map(int, input().split()) map(int, input().split()) n ans *= comb(n * m - 2, k - 2) comb(n * m - 2, k - 2) ans
def sum_distance(a, b):
    x = 0
    for i in range(a):
        x += ((i + 1) * (a - i))
        x %= mod
    x *= pow(b, 2)
    return x % mod

def comb(n, r):
    x, y = 1, 1
    for i in range(n, n - r, -1):
        x *= i
        y *= i + r - n
        x %= mod
        y %= mod
    return pow(y, mod - 2, mod) * x % mod

n, m, k = map(int, input().split())
mod = pow(10, 9) + 7
ans = 0
ans += sum_distance(n - 1, m)
ans += sum_distance(m - 1, n)
ans %= mod
ans *= comb(n * m - 2, k - 2)
ans %= mod
print(ans)