from math import factorial

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

def f(N):
    a = 1
    for i in range(1, N+1):
        a *= i
        a %= mod
    return a % mod

def Comb(N, K):
    a = f(N)
    b = f(K)
    c = f(N-K)
    return (a * pow(b, mod-2, mod) * pow(c, mod-2, mod)) % mod


c = Comb(N*M-2, K-2)

ans = 0

for d in range(M):
    ans += d * (M - d) * (N ** 2)
    ans %= mod

for d in range(N):
    ans += d * (N - d) * (M ** 2)
    ans %= mod

ans *= c
ans %= mod

print(ans) from math import factorial 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 def f(N):
    a = 1
    for i in range(1, N+1):
        a *= i
        a %= mod
    return a % mod f a = 1 a 1 for i in range(1, N+1):
        a *= i
        a %= mod
     i range(1, N+1) range 1 N+1 N 1 a *= i a i a %= mod a mod return a % mod a % mod a mod N N def Comb(N, K):
    a = f(N)
    b = f(K)
    c = f(N-K)
    return (a * pow(b, mod-2, mod) * pow(c, mod-2, mod)) % mod Comb a = f(N) a f(N) f N b = f(K) b f(K) f K c = f(N-K) c f(N-K) f N-K N K return (a * pow(b, mod-2, mod) * pow(c, mod-2, mod)) % mod (a * pow(b, mod-2, mod) * pow(c, mod-2, mod)) % mod a * pow(b, mod-2, mod) * pow(c, mod-2, mod) a * pow(b, mod-2, mod) a pow(b, mod-2, mod) pow b mod-2 mod 2 mod pow(c, mod-2, mod) pow c mod-2 mod 2 mod mod N N K K c = Comb(N*M-2, K-2) c Comb(N*M-2, K-2) Comb N*M-2 N*M N M 2 K-2 K 2 ans = 0 ans 0 for d in range(M):
    ans += d * (M - d) * (N ** 2)
    ans %= mod d range(M) range M ans += d * (M - d) * (N ** 2) ans d * (M - d) * (N ** 2) d * (M - d) d M - d M d N ** 2 N 2 ans %= mod ans mod for d in range(N):
    ans += d * (N - d) * (M ** 2)
    ans %= mod d range(N) range N ans += d * (N - d) * (M ** 2) ans d * (N - d) * (M ** 2) d * (N - d) d N - d N d M ** 2 M 2 ans %= mod ans mod ans *= c ans c ans %= mod ans mod print(ans) print ans mod = 10 ** 9 + 7 10 ** 9 + 7 mod def f(N):
    a = 1
    for i in range(1, N+1):
        a *= i
        a %= mod
    return a % mod def f(N):
    a = 1
    for i in range(1, N+1):
        a *= i
        a %= mod
    return a % mod f ans %= mod mod ans K = map(int, input().split()) map(int, input().split()) K M, K = map(int, input().split()) map(int, input().split()) M ans %= mod mod ans N, M, K = map(int, input().split()) map(int, input().split()) N ans += d * (M - d) * (N ** 2) d * (M - d) * (N ** 2) ans ans *= c c ans def Comb(N, K):
    a = f(N)
    b = f(K)
    c = f(N-K)
    return (a * pow(b, mod-2, mod) * pow(c, mod-2, mod)) % mod def Comb(N, K):
    a = f(N)
    b = f(K)
    c = f(N-K)
    return (a * pow(b, mod-2, mod) * pow(c, mod-2, mod)) % mod Comb ans = 0 0 ans ans %= mod mod ans ans += d * (N - d) * (M ** 2) d * (N - d) * (M ** 2) ans c = Comb(N*M-2, K-2) Comb(N*M-2, K-2) c
from math import factorial

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

def f(N):
    a = 1
    for i in range(1, N+1):
        a *= i
        a %= mod
    return a % mod

def Comb(N, K):
    a = f(N)
    b = f(K)
    c = f(N-K)
    return (a * pow(b, mod-2, mod) * pow(c, mod-2, mod)) % mod


c = Comb(N*M-2, K-2)

ans = 0

for d in range(M):
    ans += d * (M - d) * (N ** 2)
    ans %= mod

for d in range(N):
    ans += d * (N - d) * (M ** 2)
    ans %= mod

ans *= c
ans %= mod

print(ans)