MAX = 2*10**5+100
MOD = 10**9+7
fact = [0]*MAX #fact[i]: i!
inv = [0]*MAX #inv[i]: iの逆元
finv = [0]*MAX #finv[i]: i!の逆元
fact[0] = 1
fact[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
    
for i in range(2, MAX):
    fact[i] = fact[i-1]*i%MOD
    inv[i] = MOD-inv[MOD%i]*(MOD//i)%MOD
    finv[i] = finv[i-1]*inv[i]%MOD

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

N, M, K = map(int, input().split())
ans = 0

for i in range(1, N):
    ans += i*(N-i)*M*M*C(N*M-2, K-2)
    ans %= MOD

for i in range(1, M):
    ans += i*(M-i)*N*N*C(N*M-2, K-2)
    ans %= MOD

print(ans) MAX = 2*10**5+100 MAX 2*10**5+100 2*10**5 2 10**5 10 5 100 MOD = 10**9+7 MOD 10**9+7 10**9 10 9 7 fact = [0]*MAX fact [0]*MAX [0] 0 MAX inv = [0]*MAX inv [0]*MAX [0] 0 MAX finv = [0]*MAX finv [0]*MAX [0] 0 MAX fact[0] = 1 fact[0] fact 0 1 fact[1] = 1 fact[1] fact 1 1 finv[0] = 1 finv[0] finv 0 1 finv[1] = 1 finv[1] finv 1 1 inv[1] = 1 inv[1] inv 1 1 for i in range(2, MAX):
    fact[i] = fact[i-1]*i%MOD
    inv[i] = MOD-inv[MOD%i]*(MOD//i)%MOD
    finv[i] = finv[i-1]*inv[i]%MOD i range(2, MAX) range 2 MAX fact[i] = fact[i-1]*i%MOD fact[i] fact i fact[i-1]*i%MOD fact[i-1]*i fact[i-1] fact i-1 i 1 i MOD inv[i] = MOD-inv[MOD%i]*(MOD//i)%MOD inv[i] inv i MOD-inv[MOD%i]*(MOD//i)%MOD MOD inv[MOD%i]*(MOD//i)%MOD inv[MOD%i]*(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 C(n, r):
    if n<r:
        return 0
    if n<0 or r<0:
        return 0
    return fact[n]*(finv[r]*finv[n-r]%MOD)%MOD C if n<r:
        return 0
     n<r n r return 0 0 if n<0 or r<0:
        return 0
     n<0 or r<0 n<0 n 0 r<0 r 0 return 0 0 return fact[n]*(finv[r]*finv[n-r]%MOD)%MOD fact[n]*(finv[r]*finv[n-r]%MOD)%MOD fact[n]*(finv[r]*finv[n-r]%MOD) fact[n] fact 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 N, M, K = map(int, input().split()) N map(int, input().split()) map int input().split() ().split () input split M K ans = 0 ans 0 for i in range(1, N):
    ans += i*(N-i)*M*M*C(N*M-2, K-2)
    ans %= MOD i range(1, N) range 1 N ans += i*(N-i)*M*M*C(N*M-2, K-2) ans i*(N-i)*M*M*C(N*M-2, K-2) i*(N-i)*M*M i*(N-i)*M i*(N-i) i N-i N i M M C(N*M-2, K-2) C N*M-2 N*M N M 2 K-2 K 2 ans %= MOD ans MOD for i in range(1, M):
    ans += i*(M-i)*N*N*C(N*M-2, K-2)
    ans %= MOD i range(1, M) range 1 M ans += i*(M-i)*N*N*C(N*M-2, K-2) ans i*(M-i)*N*N*C(N*M-2, K-2) i*(M-i)*N*N i*(M-i)*N i*(M-i) i M-i M i N N C(N*M-2, K-2) C N*M-2 N*M N M 2 K-2 K 2 ans %= MOD ans MOD print(ans) print ans M, K = map(int, input().split()) map(int, input().split()) M K = map(int, input().split()) map(int, input().split()) K ans %= MOD MOD ans ans += i*(N-i)*M*M*C(N*M-2, K-2) i*(N-i)*M*M*C(N*M-2, K-2) ans N, M, K = map(int, input().split()) map(int, input().split()) N inv = [0]*MAX [0]*MAX inv ans %= MOD MOD ans finv = [0]*MAX [0]*MAX finv ans += i*(M-i)*N*N*C(N*M-2, K-2) i*(M-i)*N*N*C(N*M-2, K-2) ans MAX = 2*10**5+100 2*10**5+100 MAX fact = [0]*MAX [0]*MAX fact MOD = 10**9+7 10**9+7 MOD ans = 0 0 ans def C(n, r):
    if n<r:
        return 0
    if n<0 or r<0:
        return 0
    return fact[n]*(finv[r]*finv[n-r]%MOD)%MOD def C(n, r):
    if n<r:
        return 0
    if n<0 or r<0:
        return 0
    return fact[n]*(finv[r]*finv[n-r]%MOD)%MOD C
MAX = 2*10**5+100
MOD = 10**9+7
fact = [0]*MAX #fact[i]: i!
inv = [0]*MAX #inv[i]: iの逆元
finv = [0]*MAX #finv[i]: i!の逆元
fact[0] = 1
fact[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
    
for i in range(2, MAX):
    fact[i] = fact[i-1]*i%MOD
    inv[i] = MOD-inv[MOD%i]*(MOD//i)%MOD
    finv[i] = finv[i-1]*inv[i]%MOD

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

N, M, K = map(int, input().split())
ans = 0

for i in range(1, N):
    ans += i*(N-i)*M*M*C(N*M-2, K-2)
    ans %= MOD

for i in range(1, M):
    ans += i*(M-i)*N*N*C(N*M-2, K-2)
    ans %= MOD

print(ans)