def comb(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())
MOD = 10**9+7
sumx = 0
sumy = 0

for d in range(1, N):
    cnt = (N-d)*M**2
    cnt %= MOD
    cnt *= comb(N*M-2, K-2, MOD)
    sumx += d*cnt
    sumx %= MOD

for d in range(1, M):
    cnt = (M-d)*N**2
    cnt %= MOD
    cnt *= comb(N*M-2, K-2, MOD)
    sumy += d*cnt
    sumy %= MOD
print((sumx + sumy)%MOD) def comb(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 comb 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 MOD = 10**9+7 MOD 10**9+7 10**9 10 9 7 sumx = 0 sumx 0 sumy = 0 sumy 0 for d in range(1, N):
    cnt = (N-d)*M**2
    cnt %= MOD
    cnt *= comb(N*M-2, K-2, MOD)
    sumx += d*cnt
    sumx %= MOD d range(1, N) range 1 N cnt = (N-d)*M**2 cnt (N-d)*M**2 N-d N d M**2 M 2 cnt %= MOD cnt MOD cnt *= comb(N*M-2, K-2, MOD) cnt comb(N*M-2, K-2, MOD) comb N*M-2 N*M N M 2 K-2 K 2 MOD sumx += d*cnt sumx d*cnt d cnt sumx %= MOD sumx MOD for d in range(1, M):
    cnt = (M-d)*N**2
    cnt %= MOD
    cnt *= comb(N*M-2, K-2, MOD)
    sumy += d*cnt
    sumy %= MOD d range(1, M) range 1 M cnt = (M-d)*N**2 cnt (M-d)*N**2 M-d M d N**2 N 2 cnt %= MOD cnt MOD cnt *= comb(N*M-2, K-2, MOD) cnt comb(N*M-2, K-2, MOD) comb N*M-2 N*M N M 2 K-2 K 2 MOD sumy += d*cnt sumy d*cnt d cnt sumy %= MOD sumy MOD print((sumx + sumy)%MOD) print (sumx + sumy)%MOD sumx + sumy sumx sumy MOD M, K = map(int, input().split()) map(int, input().split()) M MOD = 10**9+7 10**9+7 MOD cnt *= comb(N*M-2, K-2, MOD) comb(N*M-2, K-2, MOD) cnt N, M, K = map(int, input().split()) map(int, input().split()) N cnt *= comb(N*M-2, K-2, MOD) comb(N*M-2, K-2, MOD) cnt sumx %= MOD MOD sumx sumy = 0 0 sumy cnt %= MOD MOD cnt factinv = [1, 1] [1, 1] factinv cnt = (M-d)*N**2 (M-d)*N**2 cnt fact = [1, 1] [1, 1] fact def comb(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 comb(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 comb sumx = 0 0 sumx sumy %= MOD MOD sumy cnt = (N-d)*M**2 (N-d)*M**2 cnt inv = [0, 1] [0, 1] inv sumx += d*cnt d*cnt sumx p = 10 ** 9 + 7 10 ** 9 + 7 p K = map(int, input().split()) map(int, input().split()) K sumy += d*cnt d*cnt sumy cnt %= MOD MOD cnt N = 10 ** 6 10 ** 6 N
def comb(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())
MOD = 10**9+7
sumx = 0
sumy = 0

for d in range(1, N):
    cnt = (N-d)*M**2
    cnt %= MOD
    cnt *= comb(N*M-2, K-2, MOD)
    sumx += d*cnt
    sumx %= MOD

for d in range(1, M):
    cnt = (M-d)*N**2
    cnt %= MOD
    cnt *= comb(N*M-2, K-2, MOD)
    sumy += d*cnt
    sumy %= MOD
print((sumx + sumy)%MOD)