# python 3.4.3
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# library
# -------------------------------------------------------------
def init_fact(n,mod):
    fact,finv,inv = [1]*n,[1]*n,[1]*n
    for i in range(2,n):
        fact[i] = (fact[i-1]*i) % mod
        inv[i]  = mod - inv[mod%i] * (mod//i)%mod
        finv[i] = finv[i-1] * inv[i] % mod
    return (fact,finv,inv)
 
def nCr(n,r,mod,fact,finv):
    if n<r:
        return 0
    else:
        return fact[n] * (finv[r] * finv[n-r] % mod) % mod

mod = 10**9+7
fact,finv,inv = init_fact(200010,mod)


# -------------------------------------------------------------
# main
# -------------------------------------------------------------

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

ans = 0
for d in range(1,N):
    t = d * nCr(N*M-2, K-2, mod, fact, finv)
    t %= mod
    t *= (N-d)*M*M
    t %= mod
    ans += t
    ans %= mod
for d in range(1,M):
    t = d * nCr(N*M-2, K-2, mod, fact, finv)
    t %= mod
    t *= (M-d)*N*N
    t %= mod
    ans += t
    ans %= mod

print(ans) import sys sys input = sys.stdin.readline input sys.stdin.readline sys.stdin sys stdin readline def init_fact(n,mod):
    fact,finv,inv = [1]*n,[1]*n,[1]*n
    for i in range(2,n):
        fact[i] = (fact[i-1]*i) % mod
        inv[i]  = mod - inv[mod%i] * (mod//i)%mod
        finv[i] = finv[i-1] * inv[i] % mod
    return (fact,finv,inv)
  init_fact fact,finv,inv = [1]*n,[1]*n,[1]*n fact [1]*n [1] 1 n finv [1]*n [1] 1 n inv [1]*n [1] 1 n for i in range(2,n):
        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,n) range 2 n 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 return (fact,finv,inv) (fact,finv,inv) fact finv inv n n mod mod def nCr(n,r,mod,fact,finv):
    if n<r:
        return 0
    else:
        return fact[n] * (finv[r] * finv[n-r] % mod) % mod nCr if n<r:
        return 0
    else:
        return fact[n] * (finv[r] * finv[n-r] % mod) % mod n<r n r 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 mod mod fact fact finv finv mod = 10**9+7 mod 10**9+7 10**9 10 9 7 fact,finv,inv = init_fact(200010,mod) fact init_fact(200010,mod) init_fact 200010 mod finv inv 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 d in range(1,N):
    t = d * nCr(N*M-2, K-2, mod, fact, finv)
    t %= mod
    t *= (N-d)*M*M
    t %= mod
    ans += t
    ans %= mod d range(1,N) range 1 N t = d * nCr(N*M-2, K-2, mod, fact, finv) t d * nCr(N*M-2, K-2, mod, fact, finv) d nCr(N*M-2, K-2, mod, fact, finv) nCr N*M-2 N*M N M 2 K-2 K 2 mod fact finv t %= mod t mod t *= (N-d)*M*M t (N-d)*M*M (N-d)*M N-d N d M M t %= mod t mod ans += t ans t ans %= mod ans mod for d in range(1,M):
    t = d * nCr(N*M-2, K-2, mod, fact, finv)
    t %= mod
    t *= (M-d)*N*N
    t %= mod
    ans += t
    ans %= mod d range(1,M) range 1 M t = d * nCr(N*M-2, K-2, mod, fact, finv) t d * nCr(N*M-2, K-2, mod, fact, finv) d nCr(N*M-2, K-2, mod, fact, finv) nCr N*M-2 N*M N M 2 K-2 K 2 mod fact finv t %= mod t mod t *= (M-d)*N*N t (M-d)*N*N (M-d)*N M-d M d N N t %= mod t mod ans += t ans t ans %= mod ans mod print(ans) print ans finv,inv = init_fact(200010,mod) init_fact(200010,mod) finv ans = 0 0 ans t *= (M-d)*N*N (M-d)*N*N t def nCr(n,r,mod,fact,finv):
    if n<r:
        return 0
    else:
        return fact[n] * (finv[r] * finv[n-r] % mod) % mod def nCr(n,r,mod,fact,finv):
    if n<r:
        return 0
    else:
        return fact[n] * (finv[r] * finv[n-r] % mod) % mod nCr t *= (N-d)*M*M (N-d)*M*M t t %= mod mod t fact,finv,inv = init_fact(200010,mod) init_fact(200010,mod) fact M,K = map(int,input().split()) map(int,input().split()) M ans += t t ans ans += t t ans N,M,K = map(int,input().split()) map(int,input().split()) N t = d * nCr(N*M-2, K-2, mod, fact, finv) d * nCr(N*M-2, K-2, mod, fact, finv) t ans %= mod mod ans input = sys.stdin.readline sys.stdin.readline input mod = 10**9+7 10**9+7 mod K = map(int,input().split()) map(int,input().split()) K t %= mod mod t ans %= mod mod ans inv = init_fact(200010,mod) init_fact(200010,mod) inv def init_fact(n,mod):
    fact,finv,inv = [1]*n,[1]*n,[1]*n
    for i in range(2,n):
        fact[i] = (fact[i-1]*i) % mod
        inv[i]  = mod - inv[mod%i] * (mod//i)%mod
        finv[i] = finv[i-1] * inv[i] % mod
    return (fact,finv,inv)
  def init_fact(n,mod):
    fact,finv,inv = [1]*n,[1]*n,[1]*n
    for i in range(2,n):
        fact[i] = (fact[i-1]*i) % mod
        inv[i]  = mod - inv[mod%i] * (mod//i)%mod
        finv[i] = finv[i-1] * inv[i] % mod
    return (fact,finv,inv)
  init_fact t %= mod mod t t = d * nCr(N*M-2, K-2, mod, fact, finv) d * nCr(N*M-2, K-2, mod, fact, finv) t t %= mod mod t
# python 3.4.3
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# library
# -------------------------------------------------------------
def init_fact(n,mod):
    fact,finv,inv = [1]*n,[1]*n,[1]*n
    for i in range(2,n):
        fact[i] = (fact[i-1]*i) % mod
        inv[i]  = mod - inv[mod%i] * (mod//i)%mod
        finv[i] = finv[i-1] * inv[i] % mod
    return (fact,finv,inv)
 
def nCr(n,r,mod,fact,finv):
    if n<r:
        return 0
    else:
        return fact[n] * (finv[r] * finv[n-r] % mod) % mod

mod = 10**9+7
fact,finv,inv = init_fact(200010,mod)


# -------------------------------------------------------------
# main
# -------------------------------------------------------------

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

ans = 0
for d in range(1,N):
    t = d * nCr(N*M-2, K-2, mod, fact, finv)
    t %= mod
    t *= (N-d)*M*M
    t %= mod
    ans += t
    ans %= mod
for d in range(1,M):
    t = d * nCr(N*M-2, K-2, mod, fact, finv)
    t %= mod
    t *= (M-d)*N*N
    t %= mod
    ans += t
    ans %= mod

print(ans)