"""

https://atcoder.jp/contests/abc127/submissions/5606400

"""





def inv(x):

    return pow(x, MOD - 2, MOD)





def cmb(n, r):

    r = min(r, n - r)

    if r == 0:

        return 1

    if r == 1:

        return n



    f = 1

    for k in range(n, n - r, -1):

        f = (f * k) % MOD

        # n!/(n-r)!



    d = 1

    for k in range(2, r + 1):

        d = (d * k) % MOD

        # r!



    return (f * inv(d)) % MOD





MOD = 10 ** 9 + 7



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



ans = 0



for i in range(M):

    ans += i * (M - i) * N ** 2



for i in range(N):

    ans += i * (N - i) * M ** 2



pat = cmb(N * M - 2, K - 2)

ans = (ans * pat) % MOD



print(ans)

# https://atcoder.jp/contests/abc127/submissions/5606400



from functools import reduce





def mod_mul(a, b):

    return (a * b) % MOD





def cmb(n, r):

    r = min(r, n - r)

    if r == 0:

        return 1

    if r == 1:

        return n



    f = reduce(mod_mul, list(range(n - r + 1, n + 1)))  # n!/(n-r)!

    d = reduce(mod_mul, list(range(2, r + 1)))  # r!

    return (f * pow(d, MOD - 2, MOD)) % MOD





MOD = 10 ** 9 + 7



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



ans_x = 0

for i in range(M):

    ans_x += i * (M - i)

ans_x *= N ** 2



ans_y = 0

for i in range(N):

    ans_y += i * (N - i)

ans_y *= M ** 2



ans = ans_x + ans_y



pat = cmb(N * M - 2, K - 2)

ans = (ans * pat) % MOD



print(ans)

"""
https://atcoder.jp/contests/abc127/submissions/5606400
"""


def inv(x):
    return pow(x, MOD - 2, MOD)


def cmb(n, r):
    r = min(r, n - r)
    if r == 0:
        return 1
    if r == 1:
        return n
    f = 1
    for k in range(n, n - r, -1):
        f = (f * k) % MOD
        # n!/(n-r)!
    d = 1
    for k in range(2, r + 1):
        d = (d * k) % MOD
        # r!
    return (f * inv(d)) % MOD


MOD = 10**9 + 7
N, M, K = list(map(int, input().split()))
ans = 0
for i in range(M):
    ans += i * (M - i) * N**2
for i in range(N):
    ans += i * (N - i) * M**2
pat = cmb(N * M - 2, K - 2)
ans = (ans * pat) % MOD
print(ans)

# https://atcoder.jp/contests/abc127/submissions/5606400
from functools import reduce


def mod_mul(a, b):
    return (a * b) % MOD


def cmb(n, r):
    r = min(r, n - r)
    if r == 0:
        return 1
    if r == 1:
        return n
    f = reduce(mod_mul, list(range(n - r + 1, n + 1)))  # n!/(n-r)!
    d = reduce(mod_mul, list(range(2, r + 1)))  # r!
    return (f * pow(d, MOD - 2, MOD)) % MOD


MOD = 10**9 + 7
N, M, K = list(map(int, input().split()))
ans_x = 0
for i in range(M):
    ans_x += i * (M - i)
ans_x *= N**2
ans_y = 0
for i in range(N):
    ans_y += i * (N - i)
ans_y *= M**2
ans = ans_x + ans_y
pat = cmb(N * M - 2, K - 2)
ans = (ans * pat) % MOD
print(ans)

-""" -https://atcoder.jp/contests/abc127/submissions/5606400 -""" +# https://atcoder.jp/contests/abc127/submissions/5606400 +from functools import reduce -def inv(x): -    return pow(x, MOD - 2, MOD) +def mod_mul(a, b): +    return (a * b) % MOD -    f = 1 -    for k in range(n, n - r, -1): -        f = (f * k) % MOD -        # n!/(n-r)! -    d = 1 -    for k in range(2, r + 1): -        d = (d * k) % MOD -        # r! -    return (f * inv(d)) % MOD +    f = reduce(mod_mul, list(range(n - r + 1, n + 1)))  # n!/(n-r)! +    d = reduce(mod_mul, list(range(2, r + 1)))  # r! +    return (f * pow(d, MOD - 2, MOD)) % MOD -ans = 0 +ans_x = 0 -    ans += i * (M - i) * N**2 +    ans_x += i * (M - i) +ans_x *= N**2 +ans_y = 0 -    ans += i * (N - i) * M**2 +    ans_y += i * (N - i) +ans_y *= M**2 +ans = ans_x + ans_y