def power(a, b):
	if b == 0:
		return 1
	elif b == 1:
		return a % 1000000007
	elif b % 2 == 0:
		return (power(a, b//2) ** 2) % 1000000007
	else:
		return (power(a, b//2) ** 2 * a) % 1000000007
 
def divide(a, b):
	return (a * power(b, 1000000005)) % 1000000007

fac_lim = 200000
fac = [None]*(fac_lim+1)
fac[0] = 1
for i in range(fac_lim):
    fac[i+1] = fac[i] * (i+1)
    fac[i+1] = fac[i + 1] % 1000000007

fac_inv = [None]*(fac_lim+1)
fac_inv[fac_lim] = power(fac[fac_lim], 1000000005)
for i in range(fac_lim, 0, -1):
    fac_inv[i-1] = (fac_inv[i] * i)  % 1000000007

def conv(a, b):
    return (fac[a] * fac_inv[a-b] * fac_inv[b]) % 1000000007

MOD = 1000000007
N, M, K = (int(i) for i in input().split())
midN = 0
midM = 0
if N > 1:
    for i in range(1,N):
        midN += i*(N-i)*2
        midN % MOD
    midN = divide(midN, N**2)
else:
    midN = 0
if M > 1:
    for i in range(1,M):
        midM += i*(M-i)*2
        midM % MOD
    midM = divide(midM, M**2)
else:
    midM = 0
kt = (midN+midM)*(N*M)
kt = divide(kt, N*M-1)
pt = conv(N*M, K)
ans = kt*pt % MOD
ans = ans*K*(K-1) % MOD
ans = divide(ans, 2)
print(ans%MOD) def power(a, b):
	if b == 0:
		return 1
	elif b == 1:
		return a % 1000000007
	elif b % 2 == 0:
		return (power(a, b//2) ** 2) % 1000000007
	else:
		return (power(a, b//2) ** 2 * a) % 1000000007
  power if b == 0:
		return 1
	elif b == 1:
		return a % 1000000007
	elif b % 2 == 0:
		return (power(a, b//2) ** 2) % 1000000007
	else:
		return (power(a, b//2) ** 2 * a) % 1000000007
  b == 0 b 0 return 1 1 elif b == 1:
		return a % 1000000007
	 b == 1 b 1 return a % 1000000007 a % 1000000007 a 1000000007 elif b % 2 == 0:
		return (power(a, b//2) ** 2) % 1000000007
	 b % 2 == 0 b % 2 b 2 0 return (power(a, b//2) ** 2) % 1000000007 (power(a, b//2) ** 2) % 1000000007 power(a, b//2) ** 2 power(a, b//2) power a b//2 b 2 2 1000000007 return (power(a, b//2) ** 2 * a) % 1000000007 (power(a, b//2) ** 2 * a) % 1000000007 power(a, b//2) ** 2 * a power(a, b//2) ** 2 power(a, b//2) power a b//2 b 2 2 a 1000000007 a a b b def divide(a, b):
	return (a * power(b, 1000000005)) % 1000000007 divide return (a * power(b, 1000000005)) % 1000000007 (a * power(b, 1000000005)) % 1000000007 a * power(b, 1000000005) a power(b, 1000000005) power b 1000000005 1000000007 a a b b fac_lim = 200000 fac_lim 200000 fac = [None]*(fac_lim+1) fac [None]*(fac_lim+1) [None] None fac_lim+1 fac_lim 1 fac[0] = 1 fac[0] fac 0 1 for i in range(fac_lim):
    fac[i+1] = fac[i] * (i+1)
    fac[i+1] = fac[i + 1] % 1000000007 i range(fac_lim) range fac_lim fac[i+1] = fac[i] * (i+1) fac[i+1] fac i+1 i 1 fac[i] * (i+1) fac[i] fac i i+1 i 1 fac[i+1] = fac[i + 1] % 1000000007 fac[i+1] fac i+1 i 1 fac[i + 1] % 1000000007 fac[i + 1] fac i + 1 i 1 1000000007 fac_inv = [None]*(fac_lim+1) fac_inv [None]*(fac_lim+1) [None] None fac_lim+1 fac_lim 1 fac_inv[fac_lim] = power(fac[fac_lim], 1000000005) fac_inv[fac_lim] fac_inv fac_lim power(fac[fac_lim], 1000000005) power fac[fac_lim] fac fac_lim 1000000005 for i in range(fac_lim, 0, -1):
    fac_inv[i-1] = (fac_inv[i] * i)  % 1000000007 i range(fac_lim, 0, -1) range fac_lim 0 -1 fac_inv[i-1] = (fac_inv[i] * i)  % 1000000007 fac_inv[i-1] fac_inv i-1 i 1 (fac_inv[i] * i)  % 1000000007 fac_inv[i] * i fac_inv[i] fac_inv i i 1000000007 def conv(a, b):
    return (fac[a] * fac_inv[a-b] * fac_inv[b]) % 1000000007 conv return (fac[a] * fac_inv[a-b] * fac_inv[b]) % 1000000007 (fac[a] * fac_inv[a-b] * fac_inv[b]) % 1000000007 fac[a] * fac_inv[a-b] * fac_inv[b] fac[a] * fac_inv[a-b] fac[a] fac a fac_inv[a-b] fac_inv a-b a b fac_inv[b] fac_inv b 1000000007 a a b b MOD = 1000000007 MOD 1000000007 int(i) for i in input().split() for i in input().split() i input().split() ().split () input split for i in input().split() int(i) int i N, M, K = (int(i) for i in input().split()) N (int(i) for i in input().split()) M K midN = 0 midN 0 midM = 0 midM 0 if N > 1:
    for i in range(1,N):
        midN += i*(N-i)*2
        midN % MOD
    midN = divide(midN, N**2)
else:
    midN = 0 N > 1 N 1 for i in range(1,N):
        midN += i*(N-i)*2
        midN % MOD
     i range(1,N) range 1 N midN += i*(N-i)*2 midN i*(N-i)*2 i*(N-i) i N-i N i 2 midN % MOD midN MOD midN = divide(midN, N**2) midN divide(midN, N**2) divide midN N**2 N 2 midN = 0 midN 0 if M > 1:
    for i in range(1,M):
        midM += i*(M-i)*2
        midM % MOD
    midM = divide(midM, M**2)
else:
    midM = 0 M > 1 M 1 for i in range(1,M):
        midM += i*(M-i)*2
        midM % MOD
     i range(1,M) range 1 M midM += i*(M-i)*2 midM i*(M-i)*2 i*(M-i) i M-i M i 2 midM % MOD midM MOD midM = divide(midM, M**2) midM divide(midM, M**2) divide midM M**2 M 2 midM = 0 midM 0 kt = (midN+midM)*(N*M) kt (midN+midM)*(N*M) midN+midM midN midM N*M N M kt = divide(kt, N*M-1) kt divide(kt, N*M-1) divide kt N*M-1 N*M N M 1 pt = conv(N*M, K) pt conv(N*M, K) conv N*M N M K ans = kt*pt % MOD ans kt*pt % MOD kt*pt kt pt MOD ans = ans*K*(K-1) % MOD ans ans*K*(K-1) % MOD ans*K*(K-1) ans*K ans K K-1 K 1 MOD ans = divide(ans, 2) ans divide(ans, 2) divide ans 2 print(ans%MOD) print ans%MOD ans MOD def divide(a, b):
	return (a * power(b, 1000000005)) % 1000000007 def divide(a, b):
	return (a * power(b, 1000000005)) % 1000000007 divide def power(a, b):
	if b == 0:
		return 1
	elif b == 1:
		return a % 1000000007
	elif b % 2 == 0:
		return (power(a, b//2) ** 2) % 1000000007
	else:
		return (power(a, b//2) ** 2 * a) % 1000000007
  def power(a, b):
	if b == 0:
		return 1
	elif b == 1:
		return a % 1000000007
	elif b % 2 == 0:
		return (power(a, b//2) ** 2) % 1000000007
	else:
		return (power(a, b//2) ** 2 * a) % 1000000007
  power midM = 0 0 midM ans = kt*pt % MOD kt*pt % MOD ans pt = conv(N*M, K) conv(N*M, K) pt ans = divide(ans, 2) divide(ans, 2) ans midN = divide(midN, N**2) divide(midN, N**2) midN def conv(a, b):
    return (fac[a] * fac_inv[a-b] * fac_inv[b]) % 1000000007 def conv(a, b):
    return (fac[a] * fac_inv[a-b] * fac_inv[b]) % 1000000007 conv fac = [None]*(fac_lim+1) [None]*(fac_lim+1) fac midM += i*(M-i)*2 i*(M-i)*2 midM MOD = 1000000007 1000000007 MOD fac_lim = 200000 200000 fac_lim kt = (midN+midM)*(N*M) (midN+midM)*(N*M) kt M, K = (int(i) for i in input().split()) (int(i) for i in input().split()) M midN = 0 0 midN midN += i*(N-i)*2 i*(N-i)*2 midN N, M, K = (int(i) for i in input().split()) (int(i) for i in input().split()) N kt = divide(kt, N*M-1) divide(kt, N*M-1) kt fac_inv = [None]*(fac_lim+1) [None]*(fac_lim+1) fac_inv midM = 0 0 midM ans = ans*K*(K-1) % MOD ans*K*(K-1) % MOD ans midM = divide(midM, M**2) divide(midM, M**2) midM K = (int(i) for i in input().split()) (int(i) for i in input().split()) K midN = 0 0 midN
def power(a, b):
	if b == 0:
		return 1
	elif b == 1:
		return a % 1000000007
	elif b % 2 == 0:
		return (power(a, b//2) ** 2) % 1000000007
	else:
		return (power(a, b//2) ** 2 * a) % 1000000007
 
def divide(a, b):
	return (a * power(b, 1000000005)) % 1000000007

fac_lim = 200000
fac = [None]*(fac_lim+1)
fac[0] = 1
for i in range(fac_lim):
    fac[i+1] = fac[i] * (i+1)
    fac[i+1] = fac[i + 1] % 1000000007

fac_inv = [None]*(fac_lim+1)
fac_inv[fac_lim] = power(fac[fac_lim], 1000000005)
for i in range(fac_lim, 0, -1):
    fac_inv[i-1] = (fac_inv[i] * i)  % 1000000007

def conv(a, b):
    return (fac[a] * fac_inv[a-b] * fac_inv[b]) % 1000000007

MOD = 1000000007
N, M, K = (int(i) for i in input().split())
midN = 0
midM = 0
if N > 1:
    for i in range(1,N):
        midN += i*(N-i)*2
        midN % MOD
    midN = divide(midN, N**2)
else:
    midN = 0
if M > 1:
    for i in range(1,M):
        midM += i*(M-i)*2
        midM % MOD
    midM = divide(midM, M**2)
else:
    midM = 0
kt = (midN+midM)*(N*M)
kt = divide(kt, N*M-1)
pt = conv(N*M, K)
ans = kt*pt % MOD
ans = ans*K*(K-1) % MOD
ans = divide(ans, 2)
print(ans%MOD)