def cmb(n, r):
    return fact[n] * inv_fact[r] * inv_fact[n - r] % MOD


MOD = 10 ** 9 + 7

N, M, K = map(int, input().split())

fact = [1]
for i in range(1, N * M - 2 + 1):
    fact.append(fact[-1] * i % MOD)

inv_fact = [-1] * (N * M - 1)
inv_fact[-1] = pow(fact[-1], MOD - 2, MOD)
for i in range(N * M - 3, -1, -1):
    inv_fact[i] = inv_fact[i + 1] * (i + 1) % MOD

pat = cmb(N * M - 2, K - 2)

ans = 0

for i in range(M):
    ans += i * (M - i) * N ** 2

for i in range(N):
    ans += i * (N - i) * M ** 2

ans = (ans * pat) % MOD

print(ans) def cmb(n, r):
    return fact[n] * inv_fact[r] * inv_fact[n - r] % MOD cmb return fact[n] * inv_fact[r] * inv_fact[n - r] % MOD fact[n] * inv_fact[r] * inv_fact[n - r] % MOD fact[n] * inv_fact[r] * inv_fact[n - r] fact[n] * inv_fact[r] fact[n] fact n inv_fact[r] inv_fact r inv_fact[n - r] inv_fact n - r n r MOD n n r r 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 fact = [1] fact [1] 1 for i in range(1, N * M - 2 + 1):
    fact.append(fact[-1] * i % MOD) i range(1, N * M - 2 + 1) range 1 N * M - 2 + 1 N * M - 2 N * M N M 2 1 fact.append(fact[-1] * i % MOD) fact.append fact append fact[-1] * i % MOD fact[-1] * i fact[-1] fact -1 i MOD inv_fact = [-1] * (N * M - 1) inv_fact [-1] * (N * M - 1) [-1] -1 N * M - 1 N * M N M 1 inv_fact[-1] = pow(fact[-1], MOD - 2, MOD) inv_fact[-1] inv_fact -1 pow(fact[-1], MOD - 2, MOD) pow fact[-1] fact -1 MOD - 2 MOD 2 MOD for i in range(N * M - 3, -1, -1):
    inv_fact[i] = inv_fact[i + 1] * (i + 1) % MOD i range(N * M - 3, -1, -1) range N * M - 3 N * M N M 3 -1 -1 inv_fact[i] = inv_fact[i + 1] * (i + 1) % MOD inv_fact[i] inv_fact i inv_fact[i + 1] * (i + 1) % MOD inv_fact[i + 1] * (i + 1) inv_fact[i + 1] inv_fact i + 1 i 1 i + 1 i 1 MOD pat = cmb(N * M - 2, K - 2) pat cmb(N * M - 2, K - 2) cmb N * M - 2 N * M N M 2 K - 2 K 2 ans = 0 ans 0 for i in range(M):
    ans += i * (M - i) * N ** 2 i range(M) range 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 for i in range(N):
    ans += i * (N - i) * M ** 2 i range(N) range 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 = (ans * pat) % MOD ans (ans * pat) % MOD ans * pat ans pat MOD print(ans) print ans K = map(int, input().split()) map(int, input().split()) K pat = cmb(N * M - 2, K - 2) cmb(N * M - 2, K - 2) pat inv_fact = [-1] * (N * M - 1) [-1] * (N * M - 1) inv_fact fact = [1] [1] fact MOD = 10 ** 9 + 7 10 ** 9 + 7 MOD M, K = map(int, input().split()) map(int, input().split()) M ans += i * (N - i) * M ** 2 i * (N - i) * M ** 2 ans ans = (ans * pat) % MOD (ans * pat) % MOD ans ans = 0 0 ans def cmb(n, r):
    return fact[n] * inv_fact[r] * inv_fact[n - r] % MOD def cmb(n, r):
    return fact[n] * inv_fact[r] * inv_fact[n - r] % MOD cmb ans += i * (M - i) * N ** 2 i * (M - i) * N ** 2 ans N, M, K = map(int, input().split()) map(int, input().split()) N
def cmb(n, r):
    return fact[n] * inv_fact[r] * inv_fact[n - r] % MOD


MOD = 10 ** 9 + 7

N, M, K = map(int, input().split())

fact = [1]
for i in range(1, N * M - 2 + 1):
    fact.append(fact[-1] * i % MOD)

inv_fact = [-1] * (N * M - 1)
inv_fact[-1] = pow(fact[-1], MOD - 2, MOD)
for i in range(N * M - 3, -1, -1):
    inv_fact[i] = inv_fact[i + 1] * (i + 1) % MOD

pat = cmb(N * M - 2, K - 2)

ans = 0

for i in range(M):
    ans += i * (M - i) * N ** 2

for i in range(N):
    ans += i * (N - i) * M ** 2

ans = (ans * pat) % MOD

print(ans)
