n, m, k = map(int, input().split())
mod = 10 ** 9 + 7

res_n = 0
for i in range(1, n+1):
    res_n += (n + 1 - i) * (n - i) // 2
    res_n %= mod
res_n = (res_n * (m ** 2)) % mod

res_m = 0
for i in range(1, m+1):
    res_m += (m + 1 - i) * (m - i) // 2
    res_m %= mod
res_m = (res_m * (n ** 2)) % mod

res = res_n + res_m
#print(res)

f = [1 for _ in range(n*m)]
for i in range(1, n*m):
    f[i] = f[i-1] * i % mod

res = res * f[n*m-2] * pow(f[k-2], mod-2, mod) * pow(f[n*m-k], mod-2, mod) % mod

print(res) 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 res_n = 0 res_n 0 for i in range(1, n+1):
    res_n += (n + 1 - i) * (n - i) // 2
    res_n %= mod i range(1, n+1) range 1 n+1 n 1 res_n += (n + 1 - i) * (n - i) // 2 res_n (n + 1 - i) * (n - i) // 2 (n + 1 - i) * (n - i) n + 1 - i n + 1 n 1 i n - i n i 2 res_n %= mod res_n mod res_n = (res_n * (m ** 2)) % mod res_n (res_n * (m ** 2)) % mod res_n * (m ** 2) res_n m ** 2 m 2 mod res_m = 0 res_m 0 for i in range(1, m+1):
    res_m += (m + 1 - i) * (m - i) // 2
    res_m %= mod i range(1, m+1) range 1 m+1 m 1 res_m += (m + 1 - i) * (m - i) // 2 res_m (m + 1 - i) * (m - i) // 2 (m + 1 - i) * (m - i) m + 1 - i m + 1 m 1 i m - i m i 2 res_m %= mod res_m mod res_m = (res_m * (n ** 2)) % mod res_m (res_m * (n ** 2)) % mod res_m * (n ** 2) res_m n ** 2 n 2 mod res = res_n + res_m res res_n + res_m res_n res_m 1 for _ in range(n*m) for _ in range(n*m) _ range(n*m) range n*m n m for _ in range(n*m) 1 f = [1 for _ in range(n*m)] f [1 for _ in range(n*m)] for i in range(1, n*m):
    f[i] = f[i-1] * i % mod i range(1, n*m) range 1 n*m n m f[i] = f[i-1] * i % mod f[i] f i f[i-1] * i % mod f[i-1] * i f[i-1] f i-1 i 1 i mod res = res * f[n*m-2] * pow(f[k-2], mod-2, mod) * pow(f[n*m-k], mod-2, mod) % mod res res * f[n*m-2] * pow(f[k-2], mod-2, mod) * pow(f[n*m-k], mod-2, mod) % mod res * f[n*m-2] * pow(f[k-2], mod-2, mod) * pow(f[n*m-k], mod-2, mod) res * f[n*m-2] * pow(f[k-2], mod-2, mod) res * f[n*m-2] res f[n*m-2] f n*m-2 n*m n m 2 pow(f[k-2], mod-2, mod) pow f[k-2] f k-2 k 2 mod-2 mod 2 mod pow(f[n*m-k], mod-2, mod) pow f[n*m-k] f n*m-k n*m n m k mod-2 mod 2 mod mod print(res) print res res_n %= mod mod res_n m, k = map(int, input().split()) map(int, input().split()) m mod = 10 ** 9 + 7 10 ** 9 + 7 mod res_m = (res_m * (n ** 2)) % mod (res_m * (n ** 2)) % mod res_m n, m, k = map(int, input().split()) map(int, input().split()) n res_n = (res_n * (m ** 2)) % mod (res_n * (m ** 2)) % mod res_n res_n += (n + 1 - i) * (n - i) // 2 (n + 1 - i) * (n - i) // 2 res_n f = [1 for _ in range(n*m)] [1 for _ in range(n*m)] f res = res_n + res_m res_n + res_m res res = res * f[n*m-2] * pow(f[k-2], mod-2, mod) * pow(f[n*m-k], mod-2, mod) % mod res * f[n*m-2] * pow(f[k-2], mod-2, mod) * pow(f[n*m-k], mod-2, mod) % mod res res_m += (m + 1 - i) * (m - i) // 2 (m + 1 - i) * (m - i) // 2 res_m res_m = 0 0 res_m k = map(int, input().split()) map(int, input().split()) k res_n = 0 0 res_n res_m %= mod mod res_m
n, m, k = map(int, input().split())
mod = 10 ** 9 + 7

res_n = 0
for i in range(1, n+1):
    res_n += (n + 1 - i) * (n - i) // 2
    res_n %= mod
res_n = (res_n * (m ** 2)) % mod

res_m = 0
for i in range(1, m+1):
    res_m += (m + 1 - i) * (m - i) // 2
    res_m %= mod
res_m = (res_m * (n ** 2)) % mod

res = res_n + res_m
#print(res)

f = [1 for _ in range(n*m)]
for i in range(1, n*m):
    f[i] = f[i-1] * i % mod

res = res * f[n*m-2] * pow(f[k-2], mod-2, mod) * pow(f[n*m-k], mod-2, mod) % mod

print(res)