def mulmod(x, y, mod=10**9 + 7):
    return x * y % mod


def comb(n, k, mod=10**9 + 7):
    from functools import reduce
    k = min(k, n - k)
    x = reduce(mulmod, range(n - k + 1, n + 1), 1)
    y = reduce(mulmod, range(1, k + 1), 1)
    return x * pow(y, mod - 2, mod) % mod


def solve(string):
    n, m, k = map(int, string.split())
    mod = 10**9 + 7
    base = n * m * (n + m) * (n * m - 1) // 6 % mod
    return str(base * comb(n * m - 2, k - 2) % mod)


if __name__ == '__main__':
    print(solve(input())) def mulmod(x, y, mod=10**9 + 7):
    return x * y % mod mulmod return x * y % mod x * y % mod x * y x y mod x x y y mod=10**9 + 7 mod 10**9 + 7 10**9 10 9 7 def comb(n, k, mod=10**9 + 7):
    from functools import reduce
    k = min(k, n - k)
    x = reduce(mulmod, range(n - k + 1, n + 1), 1)
    y = reduce(mulmod, range(1, k + 1), 1)
    return x * pow(y, mod - 2, mod) % mod comb from functools import reduce k = min(k, n - k) k min(k, n - k) min k n - k n k x = reduce(mulmod, range(n - k + 1, n + 1), 1) x reduce(mulmod, range(n - k + 1, n + 1), 1) reduce mulmod range(n - k + 1, n + 1) range n - k + 1 n - k n k 1 n + 1 n 1 1 y = reduce(mulmod, range(1, k + 1), 1) y reduce(mulmod, range(1, k + 1), 1) reduce mulmod range(1, k + 1) range 1 k + 1 k 1 1 return x * pow(y, mod - 2, mod) % mod x * pow(y, mod - 2, mod) % mod x * pow(y, mod - 2, mod) x pow(y, mod - 2, mod) pow y mod - 2 mod 2 mod mod n n k k mod=10**9 + 7 mod 10**9 + 7 10**9 10 9 7 def solve(string):
    n, m, k = map(int, string.split())
    mod = 10**9 + 7
    base = n * m * (n + m) * (n * m - 1) // 6 % mod
    return str(base * comb(n * m - 2, k - 2) % mod) solve n, m, k = map(int, string.split()) n map(int, string.split()) map int string.split() string.split string split m k mod = 10**9 + 7 mod 10**9 + 7 10**9 10 9 7 base = n * m * (n + m) * (n * m - 1) // 6 % mod base n * m * (n + m) * (n * m - 1) // 6 % mod n * m * (n + m) * (n * m - 1) // 6 n * m * (n + m) * (n * m - 1) n * m * (n + m) n * m n m n + m n m n * m - 1 n * m n m 1 6 mod return str(base * comb(n * m - 2, k - 2) % mod) str(base * comb(n * m - 2, k - 2) % mod) str base * comb(n * m - 2, k - 2) % mod base * comb(n * m - 2, k - 2) base comb(n * m - 2, k - 2) comb n * m - 2 n * m n m 2 k - 2 k 2 mod string string if __name__ == '__main__':
    print(solve(input())) __name__ == '__main__' __name__ '__main__' print(solve(input())) print solve(input()) solve input() input def solve(string):
    n, m, k = map(int, string.split())
    mod = 10**9 + 7
    base = n * m * (n + m) * (n * m - 1) // 6 % mod
    return str(base * comb(n * m - 2, k - 2) % mod) def solve(string):
    n, m, k = map(int, string.split())
    mod = 10**9 + 7
    base = n * m * (n + m) * (n * m - 1) // 6 % mod
    return str(base * comb(n * m - 2, k - 2) % mod) solve def mulmod(x, y, mod=10**9 + 7):
    return x * y % mod def mulmod(x, y, mod=10**9 + 7):
    return x * y % mod mulmod def comb(n, k, mod=10**9 + 7):
    from functools import reduce
    k = min(k, n - k)
    x = reduce(mulmod, range(n - k + 1, n + 1), 1)
    y = reduce(mulmod, range(1, k + 1), 1)
    return x * pow(y, mod - 2, mod) % mod def comb(n, k, mod=10**9 + 7):
    from functools import reduce
    k = min(k, n - k)
    x = reduce(mulmod, range(n - k + 1, n + 1), 1)
    y = reduce(mulmod, range(1, k + 1), 1)
    return x * pow(y, mod - 2, mod) % mod comb
def mulmod(x, y, mod=10**9 + 7):
    return x * y % mod


def comb(n, k, mod=10**9 + 7):
    from functools import reduce
    k = min(k, n - k)
    x = reduce(mulmod, range(n - k + 1, n + 1), 1)
    y = reduce(mulmod, range(1, k + 1), 1)
    return x * pow(y, mod - 2, mod) % mod


def solve(string):
    n, m, k = map(int, string.split())
    mod = 10**9 + 7
    base = n * m * (n + m) * (n * m - 1) // 6 % mod
    return str(base * comb(n * m - 2, k - 2) % mod)


if __name__ == '__main__':
    print(solve(input()))
