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

S = 0

for d in range(n):
    S += m ** 2 * d * (n - d)
    S %= p

for d in range(m):
    S += n ** 2 * d * (m - d)
    S %= p

def fact(n, p=10**9 + 7):
    f = [1]
    for i in range(1, n+1):
        f.append(f[-1]*i%p)
    return f

def invfact(n, f, p=10**9 + 7):
    inv = [pow(f[n], p-2, p)]
    for i in range(n, 0, -1):
        inv.append(inv[-1]*i%p)
    return inv[::-1]

f = fact(n * m - 2)
invf = invfact(n * m - 2, f)

def comb(a, b):
    if a < b:
        return 0
    if a < 0 or b < 0:
        return 0
    return f[a] * invf[b] * invf[a-b] % p

S *= comb(n * m - 2, k - 2)

print(S % p) 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 p = 10 ** 9 + 7 p 10 ** 9 + 7 10 ** 9 10 9 7 S = 0 S 0 for d in range(n):
    S += m ** 2 * d * (n - d)
    S %= p d range(n) range n S += m ** 2 * d * (n - d) S m ** 2 * d * (n - d) m ** 2 * d m ** 2 m 2 d n - d n d S %= p S p for d in range(m):
    S += n ** 2 * d * (m - d)
    S %= p d range(m) range m S += n ** 2 * d * (m - d) S n ** 2 * d * (m - d) n ** 2 * d n ** 2 n 2 d m - d m d S %= p S p def fact(n, p=10**9 + 7):
    f = [1]
    for i in range(1, n+1):
        f.append(f[-1]*i%p)
    return f fact f = [1] f [1] 1 for i in range(1, n+1):
        f.append(f[-1]*i%p)
     i range(1, n+1) range 1 n+1 n 1 f.append(f[-1]*i%p) f.append f append f[-1]*i%p f[-1]*i f[-1] f -1 i p return f f n n p=10**9 + 7 p 10**9 + 7 10**9 10 9 7 def invfact(n, f, p=10**9 + 7):
    inv = [pow(f[n], p-2, p)]
    for i in range(n, 0, -1):
        inv.append(inv[-1]*i%p)
    return inv[::-1] invfact inv = [pow(f[n], p-2, p)] inv [pow(f[n], p-2, p)] pow(f[n], p-2, p) pow f[n] f n p-2 p 2 p for i in range(n, 0, -1):
        inv.append(inv[-1]*i%p)
     i range(n, 0, -1) range n 0 -1 inv.append(inv[-1]*i%p) inv.append inv append inv[-1]*i%p inv[-1]*i inv[-1] inv -1 i p return inv[::-1] inv[::-1] inv ::-1 -1 n n f f p=10**9 + 7 p 10**9 + 7 10**9 10 9 7 f = fact(n * m - 2) f fact(n * m - 2) fact n * m - 2 n * m n m 2 invf = invfact(n * m - 2, f) invf invfact(n * m - 2, f) invfact n * m - 2 n * m n m 2 f def comb(a, b):
    if a < b:
        return 0
    if a < 0 or b < 0:
        return 0
    return f[a] * invf[b] * invf[a-b] % p comb if a < b:
        return 0
     a < b a b return 0 0 if a < 0 or b < 0:
        return 0
     a < 0 or b < 0 a < 0 a 0 b < 0 b 0 return 0 0 return f[a] * invf[b] * invf[a-b] % p f[a] * invf[b] * invf[a-b] % p f[a] * invf[b] * invf[a-b] f[a] * invf[b] f[a] f a invf[b] invf b invf[a-b] invf a-b a b p a a b b S *= comb(n * m - 2, k - 2) S comb(n * m - 2, k - 2) comb n * m - 2 n * m n m 2 k - 2 k 2 print(S % p) print S % p S p S = 0 0 S def invfact(n, f, p=10**9 + 7):
    inv = [pow(f[n], p-2, p)]
    for i in range(n, 0, -1):
        inv.append(inv[-1]*i%p)
    return inv[::-1] def invfact(n, f, p=10**9 + 7):
    inv = [pow(f[n], p-2, p)]
    for i in range(n, 0, -1):
        inv.append(inv[-1]*i%p)
    return inv[::-1] invfact n, m, k = [int(i) for i in input().split()] [int(i) for i in input().split()] n S *= comb(n * m - 2, k - 2) comb(n * m - 2, k - 2) S S %= p p S S %= p p S invf = invfact(n * m - 2, f) invfact(n * m - 2, f) invf S += n ** 2 * d * (m - d) n ** 2 * d * (m - d) S def comb(a, b):
    if a < b:
        return 0
    if a < 0 or b < 0:
        return 0
    return f[a] * invf[b] * invf[a-b] % p def comb(a, b):
    if a < b:
        return 0
    if a < 0 or b < 0:
        return 0
    return f[a] * invf[b] * invf[a-b] % p comb def fact(n, p=10**9 + 7):
    f = [1]
    for i in range(1, n+1):
        f.append(f[-1]*i%p)
    return f def fact(n, p=10**9 + 7):
    f = [1]
    for i in range(1, n+1):
        f.append(f[-1]*i%p)
    return f fact S += m ** 2 * d * (n - d) m ** 2 * d * (n - d) S p = 10 ** 9 + 7 10 ** 9 + 7 p m, k = [int(i) for i in input().split()] [int(i) for i in input().split()] m f = fact(n * m - 2) fact(n * m - 2) f k = [int(i) for i in input().split()] [int(i) for i in input().split()] k
n, m, k = [int(i) for i in input().split()]
p = 10 ** 9 + 7

S = 0

for d in range(n):
    S += m ** 2 * d * (n - d)
    S %= p

for d in range(m):
    S += n ** 2 * d * (m - d)
    S %= p

def fact(n, p=10**9 + 7):
    f = [1]
    for i in range(1, n+1):
        f.append(f[-1]*i%p)
    return f

def invfact(n, f, p=10**9 + 7):
    inv = [pow(f[n], p-2, p)]
    for i in range(n, 0, -1):
        inv.append(inv[-1]*i%p)
    return inv[::-1]

f = fact(n * m - 2)
invf = invfact(n * m - 2, f)

def comb(a, b):
    if a < b:
        return 0
    if a < 0 or b < 0:
        return 0
    return f[a] * invf[b] * invf[a-b] % p

S *= comb(n * m - 2, k - 2)

print(S % p)