"""
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 = 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
""" def inv(x):
    return pow(x, MOD - 2, MOD) inv return pow(x, MOD - 2, MOD) pow(x, MOD - 2, MOD) pow x MOD - 2 MOD 2 MOD x x 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 cmb r = min(r, n - r) r min(r, n - r) min r n - r n r if r == 0:
        return 1
     r == 0 r 0 return 1 1 if r == 1:
        return n

     r == 1 r 1 return n n f = 1 f 1 for k in range(n, n - r, -1):
        f = (f * k) % MOD
        # n!/(n-r)!

     k range(n, n - r, -1) range n n - r n r -1 f = (f * k) % MOD f (f * k) % MOD f * k f k MOD d = 1 d 1 for k in range(2, r + 1):
        d = (d * k) % MOD
        # r!

     k range(2, r + 1) range 2 r + 1 r 1 d = (d * k) % MOD d (d * k) % MOD d * k d k MOD return (f * inv(d)) % MOD (f * inv(d)) % MOD f * inv(d) f inv(d) inv d MOD n n r r MOD = 10 ** 9 + 7 MOD 10 ** 9 + 7 10 ** 9 10 9 7 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(M):
    ans += i * (M - i) * N ** 2 i range(M) range M ans += i * (M - i) * N ** 2 ans i * (M - i) * N ** 2 i * (M - i) i M - i M i N ** 2 N 2 for i in range(N):
    ans += i * (N - i) * M ** 2 i range(N) range N ans += i * (N - i) * M ** 2 ans i * (N - i) * M ** 2 i * (N - i) i N - i N i M ** 2 M 2 pat = cmb(N * M - 2, K - 2) pat cmb(N * M - 2, K - 2) cmb N * M - 2 N * M N M 2 K - 2 K 2 ans = (ans * pat) % MOD ans (ans * pat) % MOD ans * pat ans pat MOD print(ans) print ans K = map(int, input().split()) map(int, input().split()) K MOD = 10 ** 9 + 7 10 ** 9 + 7 MOD N, M, K = map(int, input().split()) map(int, input().split()) N ans += i * (N - i) * M ** 2 i * (N - i) * M ** 2 ans ans = (ans * pat) % MOD (ans * pat) % MOD ans def inv(x):
    return pow(x, MOD - 2, MOD) def inv(x):
    return pow(x, MOD - 2, MOD) inv ans = 0 0 ans ans += i * (M - i) * N ** 2 i * (M - i) * N ** 2 ans pat = cmb(N * M - 2, K - 2) cmb(N * M - 2, K - 2) pat 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 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 cmb M, K = map(int, input().split()) map(int, input().split()) M
"""
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 = 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)
