from itertools import combinations
import math
def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p

p = 10 ** 9 + 7
N = 10 ** 6  # N は必要分だけ用意する
fact = [1, 1]  # fact[n] = (n! mod p)
factinv = [1, 1]  # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1]  # factinv 計算用
 
for i in range(2, N + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p)


N,M,K = map(int,input().split())
ans = 0
mod = 10**9 +7
by = cmb(N*M-2,K-2,mod)

#まずは、X軸の総和を求める。
for i in range(N):
    for j in range(M):
        cnt = M-j-1
        add = (((j+1)+(M-1))*cnt//2 - j*cnt)*N%mod
        ans += add*by%mod
        ans %= mod

for i in range(M):
    for j in range(N):
        cnt = N-j-1
        add = (((j+1)+(N-1))*cnt//2 - j*cnt)*M%mod
        ans += add*by%mod
        ans %= mod


print(ans) from itertools import combinations import math math def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p cmb if (r < 0) or (n < r):
        return 0
     (r < 0) or (n < r) r < 0 r 0 n < r n r return 0 0 r = min(r, n - r) r min(r, n - r) min r n - r n r return fact[n] * factinv[r] * factinv[n-r] % p fact[n] * factinv[r] * factinv[n-r] % p fact[n] * factinv[r] * factinv[n-r] fact[n] * factinv[r] fact[n] fact n factinv[r] factinv r factinv[n-r] factinv n-r n r p n n r r p p p = 10 ** 9 + 7 p 10 ** 9 + 7 10 ** 9 10 9 7 N = 10 ** 6 N 10 ** 6 10 6 fact = [1, 1] fact [1, 1] 1 1 factinv = [1, 1] factinv [1, 1] 1 1 inv = [0, 1] inv [0, 1] 0 1 for i in range(2, N + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p) i range(2, N + 1) range 2 N + 1 N 1 fact.append((fact[-1] * i) % p) fact.append fact append (fact[-1] * i) % p fact[-1] * i fact[-1] fact -1 i p inv.append((-inv[p % i] * (p // i)) % p) inv.append inv append (-inv[p % i] * (p // i)) % p -inv[p % i] * (p // i) -inv[p % i] inv[p % i] inv p % i p i p // i p i p factinv.append((factinv[-1] * inv[-1]) % p) factinv.append factinv append (factinv[-1] * inv[-1]) % p factinv[-1] * inv[-1] factinv[-1] factinv -1 inv[-1] inv -1 p 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 mod = 10**9 +7 mod 10**9 +7 10**9 10 9 7 by = cmb(N*M-2,K-2,mod) by cmb(N*M-2,K-2,mod) cmb N*M-2 N*M N M 2 K-2 K 2 mod for i in range(N):
    for j in range(M):
        cnt = M-j-1
        add = (((j+1)+(M-1))*cnt//2 - j*cnt)*N%mod
        ans += add*by%mod
        ans %= mod i range(N) range N for j in range(M):
        cnt = M-j-1
        add = (((j+1)+(M-1))*cnt//2 - j*cnt)*N%mod
        ans += add*by%mod
        ans %= mod j range(M) range M cnt = M-j-1 cnt M-j-1 M-j M j 1 add = (((j+1)+(M-1))*cnt//2 - j*cnt)*N%mod add (((j+1)+(M-1))*cnt//2 - j*cnt)*N%mod (((j+1)+(M-1))*cnt//2 - j*cnt)*N ((j+1)+(M-1))*cnt//2 - j*cnt ((j+1)+(M-1))*cnt//2 ((j+1)+(M-1))*cnt (j+1)+(M-1) j+1 j 1 M-1 M 1 cnt 2 j*cnt j cnt N mod ans += add*by%mod ans add*by%mod add*by add by mod ans %= mod ans mod for i in range(M):
    for j in range(N):
        cnt = N-j-1
        add = (((j+1)+(N-1))*cnt//2 - j*cnt)*M%mod
        ans += add*by%mod
        ans %= mod i range(M) range M for j in range(N):
        cnt = N-j-1
        add = (((j+1)+(N-1))*cnt//2 - j*cnt)*M%mod
        ans += add*by%mod
        ans %= mod j range(N) range N cnt = N-j-1 cnt N-j-1 N-j N j 1 add = (((j+1)+(N-1))*cnt//2 - j*cnt)*M%mod add (((j+1)+(N-1))*cnt//2 - j*cnt)*M%mod (((j+1)+(N-1))*cnt//2 - j*cnt)*M ((j+1)+(N-1))*cnt//2 - j*cnt ((j+1)+(N-1))*cnt//2 ((j+1)+(N-1))*cnt (j+1)+(N-1) j+1 j 1 N-1 N 1 cnt 2 j*cnt j cnt M mod ans += add*by%mod ans add*by%mod add*by add by mod ans %= mod ans mod print(ans) print ans ans = 0 0 ans cnt = N-j-1 N-j-1 cnt ans += add*by%mod add*by%mod ans fact = [1, 1] [1, 1] fact cnt = M-j-1 M-j-1 cnt add = (((j+1)+(M-1))*cnt//2 - j*cnt)*N%mod (((j+1)+(M-1))*cnt//2 - j*cnt)*N%mod add inv = [0, 1] [0, 1] inv factinv = [1, 1] [1, 1] factinv N,M,K = map(int,input().split()) map(int,input().split()) N ans %= mod mod ans p = 10 ** 9 + 7 10 ** 9 + 7 p by = cmb(N*M-2,K-2,mod) cmb(N*M-2,K-2,mod) by ans += add*by%mod add*by%mod ans ans %= mod mod ans add = (((j+1)+(N-1))*cnt//2 - j*cnt)*M%mod (((j+1)+(N-1))*cnt//2 - j*cnt)*M%mod add mod = 10**9 +7 10**9 +7 mod def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p cmb N = 10 ** 6 10 ** 6 N M,K = map(int,input().split()) map(int,input().split()) M K = map(int,input().split()) map(int,input().split()) K
from itertools import combinations
import math
def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p

p = 10 ** 9 + 7
N = 10 ** 6  # N は必要分だけ用意する
fact = [1, 1]  # fact[n] = (n! mod p)
factinv = [1, 1]  # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1]  # factinv 計算用
 
for i in range(2, N + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p)


N,M,K = map(int,input().split())
ans = 0
mod = 10**9 +7
by = cmb(N*M-2,K-2,mod)

#まずは、X軸の総和を求める。
for i in range(N):
    for j in range(M):
        cnt = M-j-1
        add = (((j+1)+(M-1))*cnt//2 - j*cnt)*N%mod
        ans += add*by%mod
        ans %= mod

for i in range(M):
    for j in range(N):
        cnt = N-j-1
        add = (((j+1)+(N-1))*cnt//2 - j*cnt)*M%mod
        ans += add*by%mod
        ans %= mod


print(ans)