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

def power(n, r, mod):
    if r == 0: return 1
    if r%2 == 0:
        return power(n*n % mod, r//2, mod) % mod
    if r%2 == 1:
        return n * power(n, r-1, mod) % mod

def comb(n, k, mod):
    a=framod(n, mod)
    b=framod(k, mod)
    c=framod(n-k, mod)
    return (a * power(b, mod-2, mod) * power(c, mod-2, mod)) % mod

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

ans = 0

for i in range(1, M):
    ans += (i * (M-i) * N**2) % (10**9 + 7) 
for i in range(1, N):
    ans += (i * (N-i) * M**2) % (10**9 + 7)

ans *= comb(N*M-2 , K-2, 10**9+7)

print(int(ans % (10**9+7)))
 def framod(n, mod, a=1):
    for i in range(1,n+1):
        a=a * i % mod
    return a framod for i in range(1,n+1):
        a=a * i % mod
     i range(1,n+1) range 1 n+1 n 1 a=a * i % mod a a * i % mod a * i a i mod return a a n n mod mod a=1 a 1 def power(n, r, mod):
    if r == 0: return 1
    if r%2 == 0:
        return power(n*n % mod, r//2, mod) % mod
    if r%2 == 1:
        return n * power(n, r-1, mod) % mod power if r == 0: return 1
     r == 0 r 0 if r%2 == 0:
        return power(n*n % mod, r//2, mod) % mod
     r%2 == 0 r%2 r 2 0 return power(n*n % mod, r//2, mod) % mod power(n*n % mod, r//2, mod) % mod power(n*n % mod, r//2, mod) power n*n % mod n*n n n mod r//2 r 2 mod mod if r%2 == 1:
        return n * power(n, r-1, mod) % mod r%2 == 1 r%2 r 2 1 return n * power(n, r-1, mod) % mod n * power(n, r-1, mod) % mod n * power(n, r-1, mod) n power(n, r-1, mod) power n r-1 r 1 mod mod n n r r mod mod def comb(n, k, mod):
    a=framod(n, mod)
    b=framod(k, mod)
    c=framod(n-k, mod)
    return (a * power(b, mod-2, mod) * power(c, mod-2, mod)) % mod comb a=framod(n, mod) a framod(n, mod) framod n mod b=framod(k, mod) b framod(k, mod) framod k mod c=framod(n-k, mod) c framod(n-k, mod) framod n-k n k mod return (a * power(b, mod-2, mod) * power(c, mod-2, mod)) % mod (a * power(b, mod-2, mod) * power(c, mod-2, mod)) % mod a * power(b, mod-2, mod) * power(c, mod-2, mod) a * power(b, mod-2, mod) a power(b, mod-2, mod) power b mod-2 mod 2 mod power(c, mod-2, mod) power c mod-2 mod 2 mod mod n n k k mod mod 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 i in range(1, M):
    ans += (i * (M-i) * N**2) % (10**9 + 7)  i range(1, M) range 1 M ans += (i * (M-i) * N**2) % (10**9 + 7) ans (i * (M-i) * N**2) % (10**9 + 7) i * (M-i) * N**2 i * (M-i) i M-i M i N**2 N 2 10**9 + 7 10**9 10 9 7 for i in range(1, N):
    ans += (i * (N-i) * M**2) % (10**9 + 7) i range(1, N) range 1 N ans += (i * (N-i) * M**2) % (10**9 + 7) ans (i * (N-i) * M**2) % (10**9 + 7) i * (N-i) * M**2 i * (N-i) i N-i N i M**2 M 2 10**9 + 7 10**9 10 9 7 ans *= comb(N*M-2 , K-2, 10**9+7) ans comb(N*M-2 , K-2, 10**9+7) comb N*M-2 N*M N M 2 K-2 K 2 10**9+7 10**9 10 9 7 print(int(ans % (10**9+7))) print int(ans % (10**9+7)) int ans % (10**9+7) ans 10**9+7 10**9 10 9 7 ans += (i * (N-i) * M**2) % (10**9 + 7) (i * (N-i) * M**2) % (10**9 + 7) ans K = map(int, input().split()) map(int, input().split()) K M, K = map(int, input().split()) map(int, input().split()) M N, M, K = map(int, input().split()) map(int, input().split()) N ans = 0 0 ans def power(n, r, mod):
    if r == 0: return 1
    if r%2 == 0:
        return power(n*n % mod, r//2, mod) % mod
    if r%2 == 1:
        return n * power(n, r-1, mod) % mod def power(n, r, mod):
    if r == 0: return 1
    if r%2 == 0:
        return power(n*n % mod, r//2, mod) % mod
    if r%2 == 1:
        return n * power(n, r-1, mod) % mod power def framod(n, mod, a=1):
    for i in range(1,n+1):
        a=a * i % mod
    return a def framod(n, mod, a=1):
    for i in range(1,n+1):
        a=a * i % mod
    return a framod def comb(n, k, mod):
    a=framod(n, mod)
    b=framod(k, mod)
    c=framod(n-k, mod)
    return (a * power(b, mod-2, mod) * power(c, mod-2, mod)) % mod def comb(n, k, mod):
    a=framod(n, mod)
    b=framod(k, mod)
    c=framod(n-k, mod)
    return (a * power(b, mod-2, mod) * power(c, mod-2, mod)) % mod comb ans += (i * (M-i) * N**2) % (10**9 + 7) (i * (M-i) * N**2) % (10**9 + 7) ans ans *= comb(N*M-2 , K-2, 10**9+7) comb(N*M-2 , K-2, 10**9+7) ans
def framod(n, mod, a=1):
    for i in range(1,n+1):
        a=a * i % mod
    return a

def power(n, r, mod):
    if r == 0: return 1
    if r%2 == 0:
        return power(n*n % mod, r//2, mod) % mod
    if r%2 == 1:
        return n * power(n, r-1, mod) % mod

def comb(n, k, mod):
    a=framod(n, mod)
    b=framod(k, mod)
    c=framod(n-k, mod)
    return (a * power(b, mod-2, mod) * power(c, mod-2, mod)) % mod

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

ans = 0

for i in range(1, M):
    ans += (i * (M-i) * N**2) % (10**9 + 7) 
for i in range(1, N):
    ans += (i * (N-i) * M**2) % (10**9 + 7)

ans *= comb(N*M-2 , K-2, 10**9+7)

print(int(ans % (10**9+7)))

