MOD = 10 ** 9 + 7

def mod_combination(n, k):
    def extended_gcd(a, b):
        if b == 0:
            return (a, 1, 0)
        d, x, y = extended_gcd(b, a % b)
        return (d, y, x - (a // b) * y)
    p, q = 1, 1
    for i in range(n - k + 1, n + 1):
        p = (p * i) % MOD
    for i in range(2, k + 1):
        q = (q * i) % MOD
    return p * (extended_gcd(q, MOD)[1] % MOD) % MOD

def mod_pow(a, b):
    return pow(a, b, MOD)

def mod_inv(a):
    return pow(a, MOD - 2, MOD)


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

X = mod_pow(M, 2) * (mod_pow(N, 3) - N) % MOD
Y = mod_pow(N, 2) * (mod_pow(M, 3) - M) % MOD

comb = mod_combination(N * M - 2, K - 2)

ans = (X + Y) * mod_inv(6) % MOD * comb % MOD

print(ans) MOD = 10 ** 9 + 7 MOD 10 ** 9 + 7 10 ** 9 10 9 7 def mod_combination(n, k):
    def extended_gcd(a, b):
        if b == 0:
            return (a, 1, 0)
        d, x, y = extended_gcd(b, a % b)
        return (d, y, x - (a // b) * y)
    p, q = 1, 1
    for i in range(n - k + 1, n + 1):
        p = (p * i) % MOD
    for i in range(2, k + 1):
        q = (q * i) % MOD
    return p * (extended_gcd(q, MOD)[1] % MOD) % MOD mod_combination def extended_gcd(a, b):
        if b == 0:
            return (a, 1, 0)
        d, x, y = extended_gcd(b, a % b)
        return (d, y, x - (a // b) * y)
     extended_gcd if b == 0:
            return (a, 1, 0)
         b == 0 b 0 return (a, 1, 0) (a, 1, 0) a 1 0 d, x, y = extended_gcd(b, a % b) d extended_gcd(b, a % b) extended_gcd b a % b a b x y return (d, y, x - (a // b) * y) (d, y, x - (a // b) * y) d y x - (a // b) * y x (a // b) * y a // b a b y a a b b p, q = 1, 1 p 1 q 1 for i in range(n - k + 1, n + 1):
        p = (p * i) % MOD
     i range(n - k + 1, n + 1) range n - k + 1 n - k n k 1 n + 1 n 1 p = (p * i) % MOD p (p * i) % MOD p * i p i MOD for i in range(2, k + 1):
        q = (q * i) % MOD
     i range(2, k + 1) range 2 k + 1 k 1 q = (q * i) % MOD q (q * i) % MOD q * i q i MOD return p * (extended_gcd(q, MOD)[1] % MOD) % MOD p * (extended_gcd(q, MOD)[1] % MOD) % MOD p * (extended_gcd(q, MOD)[1] % MOD) p extended_gcd(q, MOD)[1] % MOD extended_gcd(q, MOD)[1] (q, MOD) extended_gcd q MOD 1 MOD MOD n n k k def mod_pow(a, b):
    return pow(a, b, MOD) mod_pow return pow(a, b, MOD) pow(a, b, MOD) pow a b MOD a a b b def mod_inv(a):
    return pow(a, MOD - 2, MOD) mod_inv return pow(a, MOD - 2, MOD) pow(a, MOD - 2, MOD) pow a MOD - 2 MOD 2 MOD a a N, M, K = map(int, input().split()) N map(int, input().split()) map int input().split() ().split () input split M K X = mod_pow(M, 2) * (mod_pow(N, 3) - N) % MOD X mod_pow(M, 2) * (mod_pow(N, 3) - N) % MOD mod_pow(M, 2) * (mod_pow(N, 3) - N) mod_pow(M, 2) mod_pow M 2 mod_pow(N, 3) - N mod_pow(N, 3) mod_pow N 3 N MOD Y = mod_pow(N, 2) * (mod_pow(M, 3) - M) % MOD Y mod_pow(N, 2) * (mod_pow(M, 3) - M) % MOD mod_pow(N, 2) * (mod_pow(M, 3) - M) mod_pow(N, 2) mod_pow N 2 mod_pow(M, 3) - M mod_pow(M, 3) mod_pow M 3 M MOD comb = mod_combination(N * M - 2, K - 2) comb mod_combination(N * M - 2, K - 2) mod_combination N * M - 2 N * M N M 2 K - 2 K 2 ans = (X + Y) * mod_inv(6) % MOD * comb % MOD ans (X + Y) * mod_inv(6) % MOD * comb % MOD (X + Y) * mod_inv(6) % MOD * comb (X + Y) * mod_inv(6) % MOD (X + Y) * mod_inv(6) X + Y X Y mod_inv(6) mod_inv 6 MOD comb MOD print(ans) print ans MOD = 10 ** 9 + 7 10 ** 9 + 7 MOD def mod_combination(n, k):
    def extended_gcd(a, b):
        if b == 0:
            return (a, 1, 0)
        d, x, y = extended_gcd(b, a % b)
        return (d, y, x - (a // b) * y)
    p, q = 1, 1
    for i in range(n - k + 1, n + 1):
        p = (p * i) % MOD
    for i in range(2, k + 1):
        q = (q * i) % MOD
    return p * (extended_gcd(q, MOD)[1] % MOD) % MOD def mod_combination(n, k):
    def extended_gcd(a, b):
        if b == 0:
            return (a, 1, 0)
        d, x, y = extended_gcd(b, a % b)
        return (d, y, x - (a // b) * y)
    p, q = 1, 1
    for i in range(n - k + 1, n + 1):
        p = (p * i) % MOD
    for i in range(2, k + 1):
        q = (q * i) % MOD
    return p * (extended_gcd(q, MOD)[1] % MOD) % MOD mod_combination M, K = map(int, input().split()) map(int, input().split()) M K = map(int, input().split()) map(int, input().split()) K X = mod_pow(M, 2) * (mod_pow(N, 3) - N) % MOD mod_pow(M, 2) * (mod_pow(N, 3) - N) % MOD X ans = (X + Y) * mod_inv(6) % MOD * comb % MOD (X + Y) * mod_inv(6) % MOD * comb % MOD ans Y = mod_pow(N, 2) * (mod_pow(M, 3) - M) % MOD mod_pow(N, 2) * (mod_pow(M, 3) - M) % MOD Y def mod_pow(a, b):
    return pow(a, b, MOD) def mod_pow(a, b):
    return pow(a, b, MOD) mod_pow N, M, K = map(int, input().split()) map(int, input().split()) N def mod_inv(a):
    return pow(a, MOD - 2, MOD) def mod_inv(a):
    return pow(a, MOD - 2, MOD) mod_inv comb = mod_combination(N * M - 2, K - 2) mod_combination(N * M - 2, K - 2) comb
MOD = 10 ** 9 + 7

def mod_combination(n, k):
    def extended_gcd(a, b):
        if b == 0:
            return (a, 1, 0)
        d, x, y = extended_gcd(b, a % b)
        return (d, y, x - (a // b) * y)
    p, q = 1, 1
    for i in range(n - k + 1, n + 1):
        p = (p * i) % MOD
    for i in range(2, k + 1):
        q = (q * i) % MOD
    return p * (extended_gcd(q, MOD)[1] % MOD) % MOD

def mod_pow(a, b):
    return pow(a, b, MOD)

def mod_inv(a):
    return pow(a, MOD - 2, MOD)


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

X = mod_pow(M, 2) * (mod_pow(N, 3) - N) % MOD
Y = mod_pow(N, 2) * (mod_pow(M, 3) - M) % MOD

comb = mod_combination(N * M - 2, K - 2)

ans = (X + Y) * mod_inv(6) % MOD * comb % MOD

print(ans)
