N, M, K = map(int, input().split())
mod = 10**9 + 7

# N行, M列 i-j
# 1-1, 1-2, 1-3, 1-4, ... , 1-M
# 2-1, 2-2, 2-3, 2-4, ... , 2-M
# 3-1. 3-2. 3-3, 3-4, ... , 3-M
# ...
# N-1, N-2, N-3, N-4, ... , N-M

# K個の駒が上記の座表上に置かれた時の配置全種類のコストの総和を調べたい

factorial = [1 for i in range(N*M + 1)]
for i in range(1, N * M + 1):
	if i==1:
		factorial[i] = 1
	else:
		factorial[i] = factorial[i-1]*i % mod

def comb(n, k):
	return (factorial[n]*pow(factorial[n-k]*factorial[k], -1, mod)) % mod

xscore = 0
for i in range(1, N):
	xscore += i * (N-i)
xscore %= mod
xscore *= M**2 * comb(N*M-2, K-2)
xscore %= mod

yscore = 0
for i in range(1, M):
	yscore += i * (M-i)
yscore %= mod
yscore *= N**2 * comb(N*M-2, K-2)
yscore %= mod

print((xscore + yscore) % 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 1 for i in range(N*M + 1) for i in range(N*M + 1) i range(N*M + 1) range N*M + 1 N*M N M 1 for i in range(N*M + 1) 1 factorial = [1 for i in range(N*M + 1)] factorial [1 for i in range(N*M + 1)] for i in range(1, N * M + 1):
	if i==1:
		factorial[i] = 1
	else:
		factorial[i] = factorial[i-1]*i % mod i range(1, N * M + 1) range 1 N * M + 1 N * M N M 1 if i==1:
		factorial[i] = 1
	else:
		factorial[i] = factorial[i-1]*i % mod i==1 i 1 factorial[i] = 1 factorial[i] factorial i 1 factorial[i] = factorial[i-1]*i % mod factorial[i] factorial i factorial[i-1]*i % mod factorial[i-1]*i factorial[i-1] factorial i-1 i 1 i mod def comb(n, k):
	return (factorial[n]*pow(factorial[n-k]*factorial[k], -1, mod)) % mod comb return (factorial[n]*pow(factorial[n-k]*factorial[k], -1, mod)) % mod (factorial[n]*pow(factorial[n-k]*factorial[k], -1, mod)) % mod factorial[n]*pow(factorial[n-k]*factorial[k], -1, mod) factorial[n] factorial n pow(factorial[n-k]*factorial[k], -1, mod) pow factorial[n-k]*factorial[k] factorial[n-k] factorial n-k n k factorial[k] factorial k -1 mod mod n n k k xscore = 0 xscore 0 for i in range(1, N):
	xscore += i * (N-i) i range(1, N) range 1 N xscore += i * (N-i) xscore i * (N-i) i N-i N i xscore %= mod xscore mod xscore *= M**2 * comb(N*M-2, K-2) xscore M**2 * comb(N*M-2, K-2) M**2 M 2 comb(N*M-2, K-2) comb N*M-2 N*M N M 2 K-2 K 2 xscore %= mod xscore mod yscore = 0 yscore 0 for i in range(1, M):
	yscore += i * (M-i) i range(1, M) range 1 M yscore += i * (M-i) yscore i * (M-i) i M-i M i yscore %= mod yscore mod yscore *= N**2 * comb(N*M-2, K-2) yscore N**2 * comb(N*M-2, K-2) N**2 N 2 comb(N*M-2, K-2) comb N*M-2 N*M N M 2 K-2 K 2 yscore %= mod yscore mod print((xscore + yscore) % mod) print (xscore + yscore) % mod xscore + yscore xscore yscore mod xscore += i * (N-i) i * (N-i) xscore xscore %= mod mod xscore xscore = 0 0 xscore yscore = 0 0 yscore N, M, K = map(int, input().split()) map(int, input().split()) N yscore += i * (M-i) i * (M-i) yscore xscore %= mod mod xscore yscore *= N**2 * comb(N*M-2, K-2) N**2 * comb(N*M-2, K-2) yscore yscore %= mod mod yscore M, K = map(int, input().split()) map(int, input().split()) M factorial = [1 for i in range(N*M + 1)] [1 for i in range(N*M + 1)] factorial def comb(n, k):
	return (factorial[n]*pow(factorial[n-k]*factorial[k], -1, mod)) % mod def comb(n, k):
	return (factorial[n]*pow(factorial[n-k]*factorial[k], -1, mod)) % mod comb yscore %= mod mod yscore K = map(int, input().split()) map(int, input().split()) K mod = 10**9 + 7 10**9 + 7 mod xscore *= M**2 * comb(N*M-2, K-2) M**2 * comb(N*M-2, K-2) xscore
N, M, K = map(int, input().split())
mod = 10**9 + 7

# N行, M列 i-j
# 1-1, 1-2, 1-3, 1-4, ... , 1-M
# 2-1, 2-2, 2-3, 2-4, ... , 2-M
# 3-1. 3-2. 3-3, 3-4, ... , 3-M
# ...
# N-1, N-2, N-3, N-4, ... , N-M

# K個の駒が上記の座表上に置かれた時の配置全種類のコストの総和を調べたい

factorial = [1 for i in range(N*M + 1)]
for i in range(1, N * M + 1):
	if i==1:
		factorial[i] = 1
	else:
		factorial[i] = factorial[i-1]*i % mod

def comb(n, k):
	return (factorial[n]*pow(factorial[n-k]*factorial[k], -1, mod)) % mod

xscore = 0
for i in range(1, N):
	xscore += i * (N-i)
xscore %= mod
xscore *= M**2 * comb(N*M-2, K-2)
xscore %= mod

yscore = 0
for i in range(1, M):
	yscore += i * (M-i)
yscore %= mod
yscore *= N**2 * comb(N*M-2, K-2)
yscore %= mod

print((xscore + yscore) % mod)
