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


def main() -> None:
    N, M, K = map(int, input().split())
    MOD = 10 ** 9 + 7
    ans = 0
    for d in range(1, N):
        ans += M * M * (N - d) * d
        ans %= MOD
    for d in range(1, M):
        ans += N * N * (M - d) * d
        ans %= MOD

    for i in range(K - 2):
        ans = (ans * (N * M - 2 - i)) % MOD
    for i in range(K - 2):
        ans = (ans * inv(i + 1, MOD)) % MOD
    print(ans)


if __name__ == '__main__':
    main() def inv(x, mod):
    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 mod mod def main() -> None:
    N, M, K = map(int, input().split())
    MOD = 10 ** 9 + 7
    ans = 0
    for d in range(1, N):
        ans += M * M * (N - d) * d
        ans %= MOD
    for d in range(1, M):
        ans += N * N * (M - d) * d
        ans %= MOD

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

     d range(1, M) range 1 M ans += N * N * (M - d) * d ans N * N * (M - d) * d N * N * (M - d) N * N N N M - d M d d ans %= MOD ans MOD for i in range(K - 2):
        ans = (ans * (N * M - 2 - i)) % MOD
     i range(K - 2) range K - 2 K 2 ans = (ans * (N * M - 2 - i)) % MOD ans (ans * (N * M - 2 - i)) % MOD ans * (N * M - 2 - i) ans N * M - 2 - i N * M - 2 N * M N M 2 i MOD for i in range(K - 2):
        ans = (ans * inv(i + 1, MOD)) % MOD
     i range(K - 2) range K - 2 K 2 ans = (ans * inv(i + 1, MOD)) % MOD ans (ans * inv(i + 1, MOD)) % MOD ans * inv(i + 1, MOD) ans inv(i + 1, MOD) inv i + 1 i 1 MOD MOD print(ans) print ans if __name__ == '__main__':
    main() __name__ == '__main__' __name__ '__main__' main() main def inv(x, mod):
    return pow(x, mod - 2, mod) def inv(x, mod):
    return pow(x, mod - 2, mod) inv def main() -> None:
    N, M, K = map(int, input().split())
    MOD = 10 ** 9 + 7
    ans = 0
    for d in range(1, N):
        ans += M * M * (N - d) * d
        ans %= MOD
    for d in range(1, M):
        ans += N * N * (M - d) * d
        ans %= MOD

    for i in range(K - 2):
        ans = (ans * (N * M - 2 - i)) % MOD
    for i in range(K - 2):
        ans = (ans * inv(i + 1, MOD)) % MOD
    print(ans) def main() -> None:
    N, M, K = map(int, input().split())
    MOD = 10 ** 9 + 7
    ans = 0
    for d in range(1, N):
        ans += M * M * (N - d) * d
        ans %= MOD
    for d in range(1, M):
        ans += N * N * (M - d) * d
        ans %= MOD

    for i in range(K - 2):
        ans = (ans * (N * M - 2 - i)) % MOD
    for i in range(K - 2):
        ans = (ans * inv(i + 1, MOD)) % MOD
    print(ans) main
def inv(x, mod):
    return pow(x, mod - 2, mod)


def main() -> None:
    N, M, K = map(int, input().split())
    MOD = 10 ** 9 + 7
    ans = 0
    for d in range(1, N):
        ans += M * M * (N - d) * d
        ans %= MOD
    for d in range(1, M):
        ans += N * N * (M - d) * d
        ans %= MOD

    for i in range(K - 2):
        ans = (ans * (N * M - 2 - i)) % MOD
    for i in range(K - 2):
        ans = (ans * inv(i + 1, MOD)) % MOD
    print(ans)


if __name__ == '__main__':
    main()
