import math
def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))


n, m, k = map(int, input().split())
cmb = combinations_count(n * m - 2, k - 2)
cmb %= 10 ** 9 + 7
ans = 0
for i in range(1, n):
    ans += i * cmb * m * m * (n - i)
    ans %= 10 ** 9 + 7

for i in range(1, m):
    ans += i * cmb * n * n * (m - i)
    ans %= 10 ** 9 + 7

print(ans % (10 ** 9 + 7)) import math math def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) combinations_count return math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) math.factorial(n) math.factorial math factorial n math.factorial(n - r) * math.factorial(r) math.factorial(n - r) math.factorial math factorial n - r n r math.factorial(r) math.factorial math factorial r 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 cmb = combinations_count(n * m - 2, k - 2) cmb combinations_count(n * m - 2, k - 2) combinations_count n * m - 2 n * m n m 2 k - 2 k 2 cmb %= 10 ** 9 + 7 cmb 10 ** 9 + 7 10 ** 9 10 9 7 ans = 0 ans 0 for i in range(1, n):
    ans += i * cmb * m * m * (n - i)
    ans %= 10 ** 9 + 7 i range(1, n) range 1 n ans += i * cmb * m * m * (n - i) ans i * cmb * m * m * (n - i) i * cmb * m * m i * cmb * m i * cmb i cmb m m n - i n i ans %= 10 ** 9 + 7 ans 10 ** 9 + 7 10 ** 9 10 9 7 for i in range(1, m):
    ans += i * cmb * n * n * (m - i)
    ans %= 10 ** 9 + 7 i range(1, m) range 1 m ans += i * cmb * n * n * (m - i) ans i * cmb * n * n * (m - i) i * cmb * n * n i * cmb * n i * cmb i cmb n n m - i m i ans %= 10 ** 9 + 7 ans 10 ** 9 + 7 10 ** 9 10 9 7 print(ans % (10 ** 9 + 7)) print ans % (10 ** 9 + 7) ans 10 ** 9 + 7 10 ** 9 10 9 7 ans %= 10 ** 9 + 7 10 ** 9 + 7 ans ans += i * cmb * n * n * (m - i) i * cmb * n * n * (m - i) ans ans += i * cmb * m * m * (n - i) i * cmb * m * m * (n - i) ans ans %= 10 ** 9 + 7 10 ** 9 + 7 ans cmb %= 10 ** 9 + 7 10 ** 9 + 7 cmb k = map(int, input().split()) map(int, input().split()) k cmb = combinations_count(n * m - 2, k - 2) combinations_count(n * m - 2, k - 2) cmb def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) combinations_count n, m, k = map(int, input().split()) map(int, input().split()) n m, k = map(int, input().split()) map(int, input().split()) m ans = 0 0 ans
import math
def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))


n, m, k = map(int, input().split())
cmb = combinations_count(n * m - 2, k - 2)
cmb %= 10 ** 9 + 7
ans = 0
for i in range(1, n):
    ans += i * cmb * m * m * (n - i)
    ans %= 10 ** 9 + 7

for i in range(1, m):
    ans += i * cmb * n * n * (m - i)
    ans %= 10 ** 9 + 7

print(ans % (10 ** 9 + 7))