n, m, k = [int(i) for i in input().split()]
mod = 10**9+7


def kai(x, p=mod):
    a = 1
    for i in range(1, x + 1):
        a *= i
        a %= p
    return a


def comb(a, b, p=mod):
    if a < 0 or b < 0:
        return 0
    elif a < b:
        return 0
    c = 1
    c *= kai(a, p)
    c *= pow(kai(b, p), p - 2, p)
    c *= pow(kai(a - b, p), p - 2, p)
    return c % p


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

for i in range(1, m):
    ans += i * (m - i) * n ** 2
    ans %= mod
ans *= comb(n * m - 2, k - 2)
ans %= mod
print(ans) int(i) for i in input().split() for i in input().split() i input().split() ().split () input split for i in input().split() int(i) int i n, m, k = [int(i) for i in input().split()] n [int(i) for i in input().split()] m k mod = 10**9+7 mod 10**9+7 10**9 10 9 7 def kai(x, p=mod):
    a = 1
    for i in range(1, x + 1):
        a *= i
        a %= p
    return a kai a = 1 a 1 for i in range(1, x + 1):
        a *= i
        a %= p
     i range(1, x + 1) range 1 x + 1 x 1 a *= i a i a %= p a p return a a x x p=mod p mod def comb(a, b, p=mod):
    if a < 0 or b < 0:
        return 0
    elif a < b:
        return 0
    c = 1
    c *= kai(a, p)
    c *= pow(kai(b, p), p - 2, p)
    c *= pow(kai(a - b, p), p - 2, p)
    return c % p comb if a < 0 or b < 0:
        return 0
    elif a < b:
        return 0
     a < 0 or b < 0 a < 0 a 0 b < 0 b 0 return 0 0 elif a < b:
        return 0
     a < b a b return 0 0 c = 1 c 1 c *= kai(a, p) c kai(a, p) kai a p c *= pow(kai(b, p), p - 2, p) c pow(kai(b, p), p - 2, p) pow kai(b, p) kai b p p - 2 p 2 p c *= pow(kai(a - b, p), p - 2, p) c pow(kai(a - b, p), p - 2, p) pow kai(a - b, p) kai a - b a b p p - 2 p 2 p return c % p c % p c p a a b b p=mod p mod ans = 0 ans 0 for i in range(1, n):
    ans += i * (n - i) * m ** 2
    ans %= mod i range(1, n) range 1 n ans += i * (n - i) * m ** 2 ans i * (n - i) * m ** 2 i * (n - i) i n - i n i m ** 2 m 2 ans %= mod ans mod for i in range(1, m):
    ans += i * (m - i) * n ** 2
    ans %= mod i range(1, m) range 1 m ans += i * (m - i) * n ** 2 ans i * (m - i) * n ** 2 i * (m - i) i m - i m i n ** 2 n 2 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 def kai(x, p=mod):
    a = 1
    for i in range(1, x + 1):
        a *= i
        a %= p
    return a def kai(x, p=mod):
    a = 1
    for i in range(1, x + 1):
        a *= i
        a %= p
    return a kai ans *= comb(n * m - 2, k - 2) comb(n * m - 2, k - 2) ans ans = 0 0 ans def comb(a, b, p=mod):
    if a < 0 or b < 0:
        return 0
    elif a < b:
        return 0
    c = 1
    c *= kai(a, p)
    c *= pow(kai(b, p), p - 2, p)
    c *= pow(kai(a - b, p), p - 2, p)
    return c % p def comb(a, b, p=mod):
    if a < 0 or b < 0:
        return 0
    elif a < b:
        return 0
    c = 1
    c *= kai(a, p)
    c *= pow(kai(b, p), p - 2, p)
    c *= pow(kai(a - b, p), p - 2, p)
    return c % p comb m, k = [int(i) for i in input().split()] [int(i) for i in input().split()] m ans %= mod mod ans ans += i * (n - i) * m ** 2 i * (n - i) * m ** 2 ans ans %= mod mod ans n, m, k = [int(i) for i in input().split()] [int(i) for i in input().split()] n ans %= mod mod ans k = [int(i) for i in input().split()] [int(i) for i in input().split()] k ans += i * (m - i) * n ** 2 i * (m - i) * n ** 2 ans mod = 10**9+7 10**9+7 mod
n, m, k = [int(i) for i in input().split()]
mod = 10**9+7


def kai(x, p=mod):
    a = 1
    for i in range(1, x + 1):
        a *= i
        a %= p
    return a


def comb(a, b, p=mod):
    if a < 0 or b < 0:
        return 0
    elif a < b:
        return 0
    c = 1
    c *= kai(a, p)
    c *= pow(kai(b, p), p - 2, p)
    c *= pow(kai(a - b, p), p - 2, p)
    return c % p


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

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