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

a = 0
for i in range(N):
    j = N-1-i
    a += i*(i+1)//2 + j*(j+1)//2

b = 0
for i in range(M):
    j = M-1-i
    b += i*(i+1)//2 + j*(j+1)//2

MAX = N*M+5
fac = [1,1] + [0]*MAX
finv = [1,1] + [0]*MAX
inv = [0,1] + [0]*MAX
for i in range(2,MAX+2):
    fac[i] = fac[i-1] * i % MOD
    inv[i] = -inv[MOD%i] * (MOD // i) % MOD
    finv[i] = finv[i-1] * inv[i] % MOD

def ncr(n,r):
    if n < r: return 0
    if n < 0 or r < 0: return 0
    return fac[n] * (finv[r] * finv[n-r] % MOD) % MOD

ans = (a * inv[N]**2 + b * inv[M]**2) * inv[N*M-1] * (N*M)
ans *= K*(K-1)//2
ans *= ncr(N*M, K)
print(ans % 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 a = 0 a 0 for i in range(N):
    j = N-1-i
    a += i*(i+1)//2 + j*(j+1)//2 i range(N) range N j = N-1-i j N-1-i N-1 N 1 i a += i*(i+1)//2 + j*(j+1)//2 a i*(i+1)//2 + j*(j+1)//2 i*(i+1)//2 i*(i+1) i i+1 i 1 2 j*(j+1)//2 j*(j+1) j j+1 j 1 2 b = 0 b 0 for i in range(M):
    j = M-1-i
    b += i*(i+1)//2 + j*(j+1)//2 i range(M) range M j = M-1-i j M-1-i M-1 M 1 i b += i*(i+1)//2 + j*(j+1)//2 b i*(i+1)//2 + j*(j+1)//2 i*(i+1)//2 i*(i+1) i i+1 i 1 2 j*(j+1)//2 j*(j+1) j j+1 j 1 2 MAX = N*M+5 MAX N*M+5 N*M N M 5 fac = [1,1] + [0]*MAX fac [1,1] + [0]*MAX [1,1] 1 1 [0]*MAX [0] 0 MAX finv = [1,1] + [0]*MAX finv [1,1] + [0]*MAX [1,1] 1 1 [0]*MAX [0] 0 MAX inv = [0,1] + [0]*MAX inv [0,1] + [0]*MAX [0,1] 0 1 [0]*MAX [0] 0 MAX for i in range(2,MAX+2):
    fac[i] = fac[i-1] * i % MOD
    inv[i] = -inv[MOD%i] * (MOD // i) % MOD
    finv[i] = finv[i-1] * inv[i] % MOD i range(2,MAX+2) range 2 MAX+2 MAX 2 fac[i] = fac[i-1] * i % MOD fac[i] fac i fac[i-1] * i % MOD fac[i-1] * i fac[i-1] fac i-1 i 1 i MOD inv[i] = -inv[MOD%i] * (MOD // i) % MOD inv[i] inv i -inv[MOD%i] * (MOD // i) % MOD -inv[MOD%i] * (MOD // i) -inv[MOD%i] inv[MOD%i] inv MOD%i MOD i MOD // i MOD i MOD finv[i] = finv[i-1] * inv[i] % MOD finv[i] finv i finv[i-1] * inv[i] % MOD finv[i-1] * inv[i] finv[i-1] finv i-1 i 1 inv[i] inv i MOD def ncr(n,r):
    if n < r: return 0
    if n < 0 or r < 0: return 0
    return fac[n] * (finv[r] * finv[n-r] % MOD) % MOD ncr if n < r: return 0
     n < r n r if n < 0 or r < 0: return 0
     n < 0 or r < 0 n < 0 n 0 r < 0 r 0 return fac[n] * (finv[r] * finv[n-r] % MOD) % MOD fac[n] * (finv[r] * finv[n-r] % MOD) % MOD fac[n] * (finv[r] * finv[n-r] % MOD) fac[n] fac n finv[r] * finv[n-r] % MOD finv[r] * finv[n-r] finv[r] finv r finv[n-r] finv n-r n r MOD MOD n n r r ans = (a * inv[N]**2 + b * inv[M]**2) * inv[N*M-1] * (N*M) ans (a * inv[N]**2 + b * inv[M]**2) * inv[N*M-1] * (N*M) (a * inv[N]**2 + b * inv[M]**2) * inv[N*M-1] a * inv[N]**2 + b * inv[M]**2 a * inv[N]**2 a inv[N]**2 inv[N] inv N 2 b * inv[M]**2 b inv[M]**2 inv[M] inv M 2 inv[N*M-1] inv N*M-1 N*M N M 1 N*M N M ans *= K*(K-1)//2 ans K*(K-1)//2 K*(K-1) K K-1 K 1 2 ans *= ncr(N*M, K) ans ncr(N*M, K) ncr N*M N M K print(ans % MOD) print ans % MOD ans MOD a = 0 0 a ans *= K*(K-1)//2 K*(K-1)//2 ans M,K = map(int,input().split()) map(int,input().split()) M N,M,K = map(int,input().split()) map(int,input().split()) N finv = [1,1] + [0]*MAX [1,1] + [0]*MAX finv def ncr(n,r):
    if n < r: return 0
    if n < 0 or r < 0: return 0
    return fac[n] * (finv[r] * finv[n-r] % MOD) % MOD def ncr(n,r):
    if n < r: return 0
    if n < 0 or r < 0: return 0
    return fac[n] * (finv[r] * finv[n-r] % MOD) % MOD ncr fac = [1,1] + [0]*MAX [1,1] + [0]*MAX fac ans = (a * inv[N]**2 + b * inv[M]**2) * inv[N*M-1] * (N*M) (a * inv[N]**2 + b * inv[M]**2) * inv[N*M-1] * (N*M) ans ans *= ncr(N*M, K) ncr(N*M, K) ans MAX = N*M+5 N*M+5 MAX b += i*(i+1)//2 + j*(j+1)//2 i*(i+1)//2 + j*(j+1)//2 b K = map(int,input().split()) map(int,input().split()) K b = 0 0 b MOD = 10**9+7 10**9+7 MOD a += i*(i+1)//2 + j*(j+1)//2 i*(i+1)//2 + j*(j+1)//2 a j = N-1-i N-1-i j j = M-1-i M-1-i j inv = [0,1] + [0]*MAX [0,1] + [0]*MAX inv
N,M,K = map(int,input().split())
MOD = 10**9+7

a = 0
for i in range(N):
    j = N-1-i
    a += i*(i+1)//2 + j*(j+1)//2

b = 0
for i in range(M):
    j = M-1-i
    b += i*(i+1)//2 + j*(j+1)//2

MAX = N*M+5
fac = [1,1] + [0]*MAX
finv = [1,1] + [0]*MAX
inv = [0,1] + [0]*MAX
for i in range(2,MAX+2):
    fac[i] = fac[i-1] * i % MOD
    inv[i] = -inv[MOD%i] * (MOD // i) % MOD
    finv[i] = finv[i-1] * inv[i] % MOD

def ncr(n,r):
    if n < r: return 0
    if n < 0 or r < 0: return 0
    return fac[n] * (finv[r] * finv[n-r] % MOD) % MOD

ans = (a * inv[N]**2 + b * inv[M]**2) * inv[N*M-1] * (N*M)
ans *= K*(K-1)//2
ans *= ncr(N*M, K)
print(ans % MOD)