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

mod = 10 ** 9 + 7
MAX = n * m

fact = [1] * (MAX + 1)
for i in range(1, MAX + 1):
    fact[i] = (fact[i-1] * i) % mod

inv = [1] * (MAX + 1)
inv[MAX] = pow(fact[MAX], mod - 2, mod)
for i in range(MAX, 0, -1):
    inv[i-1] = (inv[i] * i) % mod


def comb(n, k):
    return fact[n] * inv[n-k] * inv[k] % mod


ans = 0
for i in range(n):
    for j in range(m):
        add = (n - i) * (m - j) * (i + j) % mod
        if i != 0 and j != 0:
            add *= 2
            add %= mod

        ans += add
        ans %= mod

ans *= comb(MAX - 2, k - 2)
ans %= mod
print(ans) 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 MAX = n * m MAX n * m n m fact = [1] * (MAX + 1) fact [1] * (MAX + 1) [1] 1 MAX + 1 MAX 1 for i in range(1, MAX + 1):
    fact[i] = (fact[i-1] * i) % mod i range(1, MAX + 1) range 1 MAX + 1 MAX 1 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 inv = [1] * (MAX + 1) inv [1] * (MAX + 1) [1] 1 MAX + 1 MAX 1 inv[MAX] = pow(fact[MAX], mod - 2, mod) inv[MAX] inv MAX pow(fact[MAX], mod - 2, mod) pow fact[MAX] fact MAX mod - 2 mod 2 mod for i in range(MAX, 0, -1):
    inv[i-1] = (inv[i] * i) % mod i range(MAX, 0, -1) range MAX 0 -1 inv[i-1] = (inv[i] * i) % mod inv[i-1] inv i-1 i 1 (inv[i] * i) % mod inv[i] * i inv[i] inv i i mod def comb(n, k):
    return fact[n] * inv[n-k] * inv[k] % mod comb return fact[n] * inv[n-k] * inv[k] % mod fact[n] * inv[n-k] * inv[k] % mod fact[n] * inv[n-k] * inv[k] fact[n] * inv[n-k] fact[n] fact n inv[n-k] inv n-k n k inv[k] inv k mod n n k k ans = 0 ans 0 for i in range(n):
    for j in range(m):
        add = (n - i) * (m - j) * (i + j) % mod
        if i != 0 and j != 0:
            add *= 2
            add %= mod

        ans += add
        ans %= mod i range(n) range n for j in range(m):
        add = (n - i) * (m - j) * (i + j) % mod
        if i != 0 and j != 0:
            add *= 2
            add %= mod

        ans += add
        ans %= mod j range(m) range m add = (n - i) * (m - j) * (i + j) % mod add (n - i) * (m - j) * (i + j) % mod (n - i) * (m - j) * (i + j) (n - i) * (m - j) n - i n i m - j m j i + j i j mod if i != 0 and j != 0:
            add *= 2
            add %= mod

         i != 0 and j != 0 i != 0 i 0 j != 0 j 0 add *= 2 add 2 add %= mod add mod ans += add ans add ans %= mod ans mod ans *= comb(MAX - 2, k - 2) ans comb(MAX - 2, k - 2) comb MAX - 2 MAX 2 k - 2 k 2 ans %= mod ans mod print(ans) print ans n, m, k = map(int, input().split()) map(int, input().split()) n m, k = map(int, input().split()) map(int, input().split()) m add %= mod mod add inv = [1] * (MAX + 1) [1] * (MAX + 1) inv ans *= comb(MAX - 2, k - 2) comb(MAX - 2, k - 2) ans MAX = n * m n * m MAX ans %= mod mod ans k = map(int, input().split()) map(int, input().split()) k ans = 0 0 ans ans %= mod mod ans add = (n - i) * (m - j) * (i + j) % mod (n - i) * (m - j) * (i + j) % mod add def comb(n, k):
    return fact[n] * inv[n-k] * inv[k] % mod def comb(n, k):
    return fact[n] * inv[n-k] * inv[k] % mod comb ans += add add ans fact = [1] * (MAX + 1) [1] * (MAX + 1) fact mod = 10 ** 9 + 7 10 ** 9 + 7 mod add *= 2 2 add
n, m, k = map(int, input().split())

mod = 10 ** 9 + 7
MAX = n * m

fact = [1] * (MAX + 1)
for i in range(1, MAX + 1):
    fact[i] = (fact[i-1] * i) % mod

inv = [1] * (MAX + 1)
inv[MAX] = pow(fact[MAX], mod - 2, mod)
for i in range(MAX, 0, -1):
    inv[i-1] = (inv[i] * i) % mod


def comb(n, k):
    return fact[n] * inv[n-k] * inv[k] % mod


ans = 0
for i in range(n):
    for j in range(m):
        add = (n - i) * (m - j) * (i + j) % mod
        if i != 0 and j != 0:
            add *= 2
            add %= mod

        ans += add
        ans %= mod

ans *= comb(MAX - 2, k - 2)
ans %= mod
print(ans)
