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

mod = 10**9 + 7
table = [1]
for i in range(N*M):
    table.append(table[-1] * (i+1) % mod)


def inv(N):
    return pow(N, mod-2, mod)  # Why mod?


def cmb(n, r):
    return table[n] * inv(table[n-r]*table[r]) % mod


print((M ** 2 * (N ** 3 - N) + N ** 2 * (M ** 3 - M)) // 6 * cmb(M * N - 2, K - 2) % mod) 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 table = [1] table [1] 1 for i in range(N*M):
    table.append(table[-1] * (i+1) % mod) i range(N*M) range N*M N M table.append(table[-1] * (i+1) % mod) table.append table append table[-1] * (i+1) % mod table[-1] * (i+1) table[-1] table -1 i+1 i 1 mod def inv(N):
    return pow(N, mod-2, mod)  # Why mod? inv return pow(N, mod-2, mod) pow(N, mod-2, mod) pow N mod-2 mod 2 mod N N def cmb(n, r):
    return table[n] * inv(table[n-r]*table[r]) % mod cmb return table[n] * inv(table[n-r]*table[r]) % mod table[n] * inv(table[n-r]*table[r]) % mod table[n] * inv(table[n-r]*table[r]) table[n] table n inv(table[n-r]*table[r]) inv table[n-r]*table[r] table[n-r] table n-r n r table[r] table r mod n n r r print((M ** 2 * (N ** 3 - N) + N ** 2 * (M ** 3 - M)) // 6 * cmb(M * N - 2, K - 2) % mod) print (M ** 2 * (N ** 3 - N) + N ** 2 * (M ** 3 - M)) // 6 * cmb(M * N - 2, K - 2) % mod (M ** 2 * (N ** 3 - N) + N ** 2 * (M ** 3 - M)) // 6 * cmb(M * N - 2, K - 2) (M ** 2 * (N ** 3 - N) + N ** 2 * (M ** 3 - M)) // 6 M ** 2 * (N ** 3 - N) + N ** 2 * (M ** 3 - M) M ** 2 * (N ** 3 - N) M ** 2 M 2 N ** 3 - N N ** 3 N 3 N N ** 2 * (M ** 3 - M) N ** 2 N 2 M ** 3 - M M ** 3 M 3 M 6 cmb(M * N - 2, K - 2) cmb M * N - 2 M * N M N 2 K - 2 K 2 mod K = map(int, input().split()) map(int, input().split()) K def cmb(n, r):
    return table[n] * inv(table[n-r]*table[r]) % mod def cmb(n, r):
    return table[n] * inv(table[n-r]*table[r]) % mod cmb table = [1] [1] table M, K = map(int, input().split()) map(int, input().split()) M mod = 10**9 + 7 10**9 + 7 mod def inv(N):
    return pow(N, mod-2, mod)  # Why mod? def inv(N):
    return pow(N, mod-2, mod)  # Why mod? inv N, M, K = map(int, input().split()) map(int, input().split()) N
N, M, K = map(int, input().split())

mod = 10**9 + 7
table = [1]
for i in range(N*M):
    table.append(table[-1] * (i+1) % mod)


def inv(N):
    return pow(N, mod-2, mod)  # Why mod?


def cmb(n, r):
    return table[n] * inv(table[n-r]*table[r]) % mod


print((M ** 2 * (N ** 3 - N) + N ** 2 * (M ** 3 - M)) // 6 * cmb(M * N - 2, K - 2) % mod)