MOD = 10**9 + 7
list_size = 200001

f_list = [1] * list_size
f_r_list = [1] * list_size

for i in range(list_size - 1):
	f_list[i + 1] = int((f_list[i] * (i + 2)) % MOD)

f_r_list[-1] = pow(f_list[-1], MOD - 2, MOD)

for i in range(2, list_size + 1):
	f_r_list[-i] = int((f_r_list[-i + 1] * (list_size + 2 - i)) % MOD)

def comb(n, r):
	if n < r:
		return 0
	elif n == 0 or r == 0 or n == r:
		return 1
	else:
		return (((f_list[n - 1] * f_r_list[n - r - 1]) % MOD) * f_r_list[r - 1]) % MOD 

n, m, k = map(int, input().split())
print(((n+m)*k*(k-1))*comb(n*m, k)*f_r_list[2]%MOD) MOD = 10**9 + 7 MOD 10**9 + 7 10**9 10 9 7 list_size = 200001 list_size 200001 f_list = [1] * list_size f_list [1] * list_size [1] 1 list_size f_r_list = [1] * list_size f_r_list [1] * list_size [1] 1 list_size for i in range(list_size - 1):
	f_list[i + 1] = int((f_list[i] * (i + 2)) % MOD) i range(list_size - 1) range list_size - 1 list_size 1 f_list[i + 1] = int((f_list[i] * (i + 2)) % MOD) f_list[i + 1] f_list i + 1 i 1 int((f_list[i] * (i + 2)) % MOD) int (f_list[i] * (i + 2)) % MOD f_list[i] * (i + 2) f_list[i] f_list i i + 2 i 2 MOD f_r_list[-1] = pow(f_list[-1], MOD - 2, MOD) f_r_list[-1] f_r_list -1 pow(f_list[-1], MOD - 2, MOD) pow f_list[-1] f_list -1 MOD - 2 MOD 2 MOD for i in range(2, list_size + 1):
	f_r_list[-i] = int((f_r_list[-i + 1] * (list_size + 2 - i)) % MOD) i range(2, list_size + 1) range 2 list_size + 1 list_size 1 f_r_list[-i] = int((f_r_list[-i + 1] * (list_size + 2 - i)) % MOD) f_r_list[-i] f_r_list -i i int((f_r_list[-i + 1] * (list_size + 2 - i)) % MOD) int (f_r_list[-i + 1] * (list_size + 2 - i)) % MOD f_r_list[-i + 1] * (list_size + 2 - i) f_r_list[-i + 1] f_r_list -i + 1 -i i 1 list_size + 2 - i list_size + 2 list_size 2 i MOD def comb(n, r):
	if n < r:
		return 0
	elif n == 0 or r == 0 or n == r:
		return 1
	else:
		return (((f_list[n - 1] * f_r_list[n - r - 1]) % MOD) * f_r_list[r - 1]) % MOD  comb if n < r:
		return 0
	elif n == 0 or r == 0 or n == r:
		return 1
	else:
		return (((f_list[n - 1] * f_r_list[n - r - 1]) % MOD) * f_r_list[r - 1]) % MOD  n < r n r return 0 0 elif n == 0 or r == 0 or n == r:
		return 1
	 n == 0 or r == 0 or n == r n == 0 or r == 0 n == 0 n 0 r == 0 r 0 n == r n r return 1 1 return (((f_list[n - 1] * f_r_list[n - r - 1]) % MOD) * f_r_list[r - 1]) % MOD (((f_list[n - 1] * f_r_list[n - r - 1]) % MOD) * f_r_list[r - 1]) % MOD ((f_list[n - 1] * f_r_list[n - r - 1]) % MOD) * f_r_list[r - 1] (f_list[n - 1] * f_r_list[n - r - 1]) % MOD f_list[n - 1] * f_r_list[n - r - 1] f_list[n - 1] f_list n - 1 n 1 f_r_list[n - r - 1] f_r_list n - r - 1 n - r n r 1 MOD f_r_list[r - 1] f_r_list r - 1 r 1 MOD n n r r n, m, k = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split m k print(((n+m)*k*(k-1))*comb(n*m, k)*f_r_list[2]%MOD) print ((n+m)*k*(k-1))*comb(n*m, k)*f_r_list[2]%MOD ((n+m)*k*(k-1))*comb(n*m, k)*f_r_list[2] ((n+m)*k*(k-1))*comb(n*m, k) (n+m)*k*(k-1) (n+m)*k n+m n m k k-1 k 1 comb(n*m, k) comb n*m n m k f_r_list[2] f_r_list 2 MOD f_r_list = [1] * list_size [1] * list_size f_r_list MOD = 10**9 + 7 10**9 + 7 MOD list_size = 200001 200001 list_size m, k = map(int, input().split()) map(int, input().split()) m f_list = [1] * list_size [1] * list_size f_list def comb(n, r):
	if n < r:
		return 0
	elif n == 0 or r == 0 or n == r:
		return 1
	else:
		return (((f_list[n - 1] * f_r_list[n - r - 1]) % MOD) * f_r_list[r - 1]) % MOD  def comb(n, r):
	if n < r:
		return 0
	elif n == 0 or r == 0 or n == r:
		return 1
	else:
		return (((f_list[n - 1] * f_r_list[n - r - 1]) % MOD) * f_r_list[r - 1]) % MOD  comb k = map(int, input().split()) map(int, input().split()) k n, m, k = map(int, input().split()) map(int, input().split()) n
MOD = 10**9 + 7
list_size = 200001

f_list = [1] * list_size
f_r_list = [1] * list_size

for i in range(list_size - 1):
	f_list[i + 1] = int((f_list[i] * (i + 2)) % MOD)

f_r_list[-1] = pow(f_list[-1], MOD - 2, MOD)

for i in range(2, list_size + 1):
	f_r_list[-i] = int((f_r_list[-i + 1] * (list_size + 2 - i)) % MOD)

def comb(n, r):
	if n < r:
		return 0
	elif n == 0 or r == 0 or n == r:
		return 1
	else:
		return (((f_list[n - 1] * f_r_list[n - r - 1]) % MOD) * f_r_list[r - 1]) % MOD 

n, m, k = map(int, input().split())
print(((n+m)*k*(k-1))*comb(n*m, k)*f_r_list[2]%MOD)