mod = 10 ** 9 + 7
kkai = [1]
for i in range(1, 3 * 10 ** 5):
    kkai.append(kkai[-1] * i % mod)


def kai(x, p=mod):
    return kkai[x]


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


n, m, k = [int(i) for i in input().split()]

ans = 0
for i in range(1, n):
    ans += (n - i) * i * comb(n * m - 2, k - 2) * m ** 2
    ans %= mod
for i in range(1, m):
    ans += (m - i) * i * comb(n * m - 2, k - 2) * n ** 2
    ans %= mod
print(ans) mod = 10 ** 9 + 7 mod 10 ** 9 + 7 10 ** 9 10 9 7 kkai = [1] kkai [1] 1 for i in range(1, 3 * 10 ** 5):
    kkai.append(kkai[-1] * i % mod) i range(1, 3 * 10 ** 5) range 1 3 * 10 ** 5 3 10 ** 5 10 5 kkai.append(kkai[-1] * i % mod) kkai.append kkai append kkai[-1] * i % mod kkai[-1] * i kkai[-1] kkai -1 i mod def kai(x, p=mod):
    return kkai[x] kai return kkai[x] kkai[x] kkai x 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 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 ans = 0 ans 0 for i in range(1, n):
    ans += (n - i) * i * comb(n * m - 2, k - 2) * m ** 2
    ans %= mod i range(1, n) range 1 n ans += (n - i) * i * comb(n * m - 2, k - 2) * m ** 2 ans (n - i) * i * comb(n * m - 2, k - 2) * m ** 2 (n - i) * i * comb(n * m - 2, k - 2) (n - i) * i n - i n i i comb(n * m - 2, k - 2) comb n * m - 2 n * m n m 2 k - 2 k 2 m ** 2 m 2 ans %= mod ans mod for i in range(1, m):
    ans += (m - i) * i * comb(n * m - 2, k - 2) * n ** 2
    ans %= mod i range(1, m) range 1 m ans += (m - i) * i * comb(n * m - 2, k - 2) * n ** 2 ans (m - i) * i * comb(n * m - 2, k - 2) * n ** 2 (m - i) * i * comb(n * m - 2, k - 2) (m - i) * i m - i m i i comb(n * m - 2, k - 2) comb n * m - 2 n * m n m 2 k - 2 k 2 n ** 2 n 2 ans %= mod ans mod print(ans) print 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 mod = 10 ** 9 + 7 10 ** 9 + 7 mod ans = 0 0 ans kkai = [1] [1] kkai ans %= mod mod ans k = [int(i) for i in input().split()] [int(i) for i in input().split()] k m, k = [int(i) for i in input().split()] [int(i) for i in input().split()] m ans %= mod mod ans def kai(x, p=mod):
    return kkai[x] def kai(x, p=mod):
    return kkai[x] kai n, m, k = [int(i) for i in input().split()] [int(i) for i in input().split()] n ans += (m - i) * i * comb(n * m - 2, k - 2) * n ** 2 (m - i) * i * comb(n * m - 2, k - 2) * n ** 2 ans ans += (n - i) * i * comb(n * m - 2, k - 2) * m ** 2 (n - i) * i * comb(n * m - 2, k - 2) * m ** 2 ans
mod = 10 ** 9 + 7
kkai = [1]
for i in range(1, 3 * 10 ** 5):
    kkai.append(kkai[-1] * i % mod)


def kai(x, p=mod):
    return kkai[x]


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


n, m, k = [int(i) for i in input().split()]

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