MOD = 10 ** 9 + 7

n, m, k = map(int, input().split())

MOD = 10 ** 9 + 7
N = n * m + 10
fact = [0 for _ in range(N)]
invfact = [0 for _ in range(N)]
fact[0] = 1
for i in range(1, N):
    fact[i] = fact[i - 1] * i % MOD

invfact[N - 1] = pow(fact[N - 1], MOD - 2, MOD)

for i in range(N - 2, -1, -1):
    invfact[i] = invfact[i + 1] * (i + 1) % MOD
def nCk(n, k):
    if k < 0 or n < k:
        return 0
    else:
        return fact[n] * invfact[k] * invfact[n - k] % MOD
        
ans = 0
for i in range(n-1, 0, -1):
    ans += m * m * (i + 1) * i // 2 
    ans %= MOD
for i in range(m - 1, 0, -1):
    ans += n * n * (i + 1) * i // 2
    ans %= MOD

ans *= nCk(n * m - 2, k - 2)
ans %= MOD
print(ans) MOD = 10 ** 9 + 7 MOD 10 ** 9 + 7 10 ** 9 10 9 7 n, m, k = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split m k MOD = 10 ** 9 + 7 MOD 10 ** 9 + 7 10 ** 9 10 9 7 N = n * m + 10 N n * m + 10 n * m n m 10 0 for _ in range(N) for _ in range(N) _ range(N) range N for _ in range(N) 0 fact = [0 for _ in range(N)] fact [0 for _ in range(N)] 0 for _ in range(N) for _ in range(N) _ range(N) range N for _ in range(N) 0 invfact = [0 for _ in range(N)] invfact [0 for _ in range(N)] fact[0] = 1 fact[0] fact 0 1 for i in range(1, N):
    fact[i] = fact[i - 1] * i % MOD i range(1, N) range 1 N fact[i] = fact[i - 1] * i % MOD fact[i] fact i fact[i - 1] * i % MOD fact[i - 1] * i fact[i - 1] fact i - 1 i 1 i MOD invfact[N - 1] = pow(fact[N - 1], MOD - 2, MOD) invfact[N - 1] invfact N - 1 N 1 pow(fact[N - 1], MOD - 2, MOD) pow fact[N - 1] fact N - 1 N 1 MOD - 2 MOD 2 MOD for i in range(N - 2, -1, -1):
    invfact[i] = invfact[i + 1] * (i + 1) % MOD i range(N - 2, -1, -1) range N - 2 N 2 -1 -1 invfact[i] = invfact[i + 1] * (i + 1) % MOD invfact[i] invfact i invfact[i + 1] * (i + 1) % MOD invfact[i + 1] * (i + 1) invfact[i + 1] invfact i + 1 i 1 i + 1 i 1 MOD def nCk(n, k):
    if k < 0 or n < k:
        return 0
    else:
        return fact[n] * invfact[k] * invfact[n - k] % MOD
         nCk if k < 0 or n < k:
        return 0
    else:
        return fact[n] * invfact[k] * invfact[n - k] % MOD
         k < 0 or n < k k < 0 k 0 n < k n k return 0 0 return fact[n] * invfact[k] * invfact[n - k] % MOD fact[n] * invfact[k] * invfact[n - k] % MOD fact[n] * invfact[k] * invfact[n - k] fact[n] * invfact[k] fact[n] fact n invfact[k] invfact k invfact[n - k] invfact n - k n k MOD n n k k ans = 0 ans 0 for i in range(n-1, 0, -1):
    ans += m * m * (i + 1) * i // 2 
    ans %= MOD i range(n-1, 0, -1) range n-1 n 1 0 -1 ans += m * m * (i + 1) * i // 2 ans m * m * (i + 1) * i // 2 m * m * (i + 1) * i m * m * (i + 1) m * m m m i + 1 i 1 i 2 ans %= MOD ans MOD for i in range(m - 1, 0, -1):
    ans += n * n * (i + 1) * i // 2
    ans %= MOD i range(m - 1, 0, -1) range m - 1 m 1 0 -1 ans += n * n * (i + 1) * i // 2 ans n * n * (i + 1) * i // 2 n * n * (i + 1) * i n * n * (i + 1) n * n n n i + 1 i 1 i 2 ans %= MOD ans MOD ans *= nCk(n * m - 2, k - 2) ans nCk(n * m - 2, k - 2) nCk n * m - 2 n * m n m 2 k - 2 k 2 ans %= MOD ans MOD print(ans) print ans k = map(int, input().split()) map(int, input().split()) k fact = [0 for _ in range(N)] [0 for _ in range(N)] fact ans *= nCk(n * m - 2, k - 2) nCk(n * m - 2, k - 2) ans ans += m * m * (i + 1) * i // 2 m * m * (i + 1) * i // 2 ans ans += n * n * (i + 1) * i // 2 n * n * (i + 1) * i // 2 ans m, k = map(int, input().split()) map(int, input().split()) m ans = 0 0 ans MOD = 10 ** 9 + 7 10 ** 9 + 7 MOD MOD = 10 ** 9 + 7 10 ** 9 + 7 MOD ans %= MOD MOD ans n, m, k = map(int, input().split()) map(int, input().split()) n N = n * m + 10 n * m + 10 N ans %= MOD MOD ans ans %= MOD MOD ans def nCk(n, k):
    if k < 0 or n < k:
        return 0
    else:
        return fact[n] * invfact[k] * invfact[n - k] % MOD
         def nCk(n, k):
    if k < 0 or n < k:
        return 0
    else:
        return fact[n] * invfact[k] * invfact[n - k] % MOD
         nCk invfact = [0 for _ in range(N)] [0 for _ in range(N)] invfact
MOD = 10 ** 9 + 7

n, m, k = map(int, input().split())

MOD = 10 ** 9 + 7
N = n * m + 10
fact = [0 for _ in range(N)]
invfact = [0 for _ in range(N)]
fact[0] = 1
for i in range(1, N):
    fact[i] = fact[i - 1] * i % MOD

invfact[N - 1] = pow(fact[N - 1], MOD - 2, MOD)

for i in range(N - 2, -1, -1):
    invfact[i] = invfact[i + 1] * (i + 1) % MOD
def nCk(n, k):
    if k < 0 or n < k:
        return 0
    else:
        return fact[n] * invfact[k] * invfact[n - k] % MOD
        
ans = 0
for i in range(n-1, 0, -1):
    ans += m * m * (i + 1) * i // 2 
    ans %= MOD
for i in range(m - 1, 0, -1):
    ans += n * n * (i + 1) * i // 2
    ans %= MOD

ans *= nCk(n * m - 2, k - 2)
ans %= MOD
print(ans)