import math

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

facts = [1 for i in range(MAX)]
invs = [1 for i in range(MAX)]

def inv(x):
	return pow(x,mod-2,mod)

for i in range(1,MAX):
    facts[i] = (facts[i-1] * i)% mod
    invs[i] = inv(facts[i])

def nCr(n,r):
	return facts[n] * invs[r] * invs[n-r] % mod

def main():
    ans = 0
    complement = nCr((N*M-2)%mod,(K-2)%mod)
    for i in range(1,N):
        ans += i * (N-i) * M**2
    for i in range(1,M):
        ans += i * (M-i) * N**2
    print((ans*complement) % mod)

main() import math math mod = 10**9+7 mod 10**9+7 10**9 10 9 7 N,M,K = map(int, input().split()) N map(int, input().split()) map int input().split() ().split () input split M K MAX = min(N*M,mod) MAX min(N*M,mod) min N*M N M mod 1 for i in range(MAX) for i in range(MAX) i range(MAX) range MAX for i in range(MAX) 1 facts = [1 for i in range(MAX)] facts [1 for i in range(MAX)] 1 for i in range(MAX) for i in range(MAX) i range(MAX) range MAX for i in range(MAX) 1 invs = [1 for i in range(MAX)] invs [1 for i in range(MAX)] def inv(x):
	return pow(x,mod-2,mod) inv return pow(x,mod-2,mod) pow(x,mod-2,mod) pow x mod-2 mod 2 mod x x for i in range(1,MAX):
    facts[i] = (facts[i-1] * i)% mod
    invs[i] = inv(facts[i]) i range(1,MAX) range 1 MAX facts[i] = (facts[i-1] * i)% mod facts[i] facts i (facts[i-1] * i)% mod facts[i-1] * i facts[i-1] facts i-1 i 1 i mod invs[i] = inv(facts[i]) invs[i] invs i inv(facts[i]) inv facts[i] facts i def nCr(n,r):
	return facts[n] * invs[r] * invs[n-r] % mod nCr return facts[n] * invs[r] * invs[n-r] % mod facts[n] * invs[r] * invs[n-r] % mod facts[n] * invs[r] * invs[n-r] facts[n] * invs[r] facts[n] facts n invs[r] invs r invs[n-r] invs n-r n r mod n n r r def main():
    ans = 0
    complement = nCr((N*M-2)%mod,(K-2)%mod)
    for i in range(1,N):
        ans += i * (N-i) * M**2
    for i in range(1,M):
        ans += i * (M-i) * N**2
    print((ans*complement) % mod) main ans = 0 ans 0 complement = nCr((N*M-2)%mod,(K-2)%mod) complement nCr((N*M-2)%mod,(K-2)%mod) nCr (N*M-2)%mod N*M-2 N*M N M 2 mod (K-2)%mod K-2 K 2 mod for i in range(1,N):
        ans += i * (N-i) * M**2
     i range(1,N) range 1 N ans += i * (N-i) * M**2 ans i * (N-i) * M**2 i * (N-i) i N-i N i M**2 M 2 for i in range(1,M):
        ans += i * (M-i) * N**2
     i range(1,M) range 1 M ans += i * (M-i) * N**2 ans i * (M-i) * N**2 i * (M-i) i M-i M i N**2 N 2 print((ans*complement) % mod) print (ans*complement) % mod ans*complement ans complement mod main() main def inv(x):
	return pow(x,mod-2,mod) def inv(x):
	return pow(x,mod-2,mod) inv def main():
    ans = 0
    complement = nCr((N*M-2)%mod,(K-2)%mod)
    for i in range(1,N):
        ans += i * (N-i) * M**2
    for i in range(1,M):
        ans += i * (M-i) * N**2
    print((ans*complement) % mod) def main():
    ans = 0
    complement = nCr((N*M-2)%mod,(K-2)%mod)
    for i in range(1,N):
        ans += i * (N-i) * M**2
    for i in range(1,M):
        ans += i * (M-i) * N**2
    print((ans*complement) % mod) main mod = 10**9+7 10**9+7 mod N,M,K = map(int, input().split()) map(int, input().split()) N M,K = map(int, input().split()) map(int, input().split()) M MAX = min(N*M,mod) min(N*M,mod) MAX def nCr(n,r):
	return facts[n] * invs[r] * invs[n-r] % mod def nCr(n,r):
	return facts[n] * invs[r] * invs[n-r] % mod nCr invs = [1 for i in range(MAX)] [1 for i in range(MAX)] invs K = map(int, input().split()) map(int, input().split()) K facts = [1 for i in range(MAX)] [1 for i in range(MAX)] facts
import math

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

facts = [1 for i in range(MAX)]
invs = [1 for i in range(MAX)]

def inv(x):
	return pow(x,mod-2,mod)

for i in range(1,MAX):
    facts[i] = (facts[i-1] * i)% mod
    invs[i] = inv(facts[i])

def nCr(n,r):
	return facts[n] * invs[r] * invs[n-r] % mod

def main():
    ans = 0
    complement = nCr((N*M-2)%mod,(K-2)%mod)
    for i in range(1,N):
        ans += i * (N-i) * M**2
    for i in range(1,M):
        ans += i * (M-i) * N**2
    print((ans*complement) % mod)

main()
