MOD = 10**9 + 7
MAX = int(2e5)


def div(a, b):
    return a * pow(b, MOD-2, MOD) % MOD


FACT = [1] * (MAX+1)
for i in range(1, MAX+1):
    FACT[i] = (i * FACT[i-1]) % MOD
INV = [1] * (MAX+1)
INV[MAX] = div(1, FACT[MAX])
for i in range(MAX, 0, -1):
    INV[i-1] = (INV[i] * i) % MOD


def combination(r, c):
    return FACT[r] * INV[r-c] * INV[c]


def main():
    N, M, K = map(int, input().split())
    ans1 = 0
    for d in range(1, N):
        ans1 = (ans1 + d * (N-d) * (M**2)) % MOD
    ans2 = 0
    for d in range(1, M):
        ans2 = (ans2 + d * (M-d) * (N**2)) % MOD
    ans = ((ans1 + ans2) * combination(M*N-2, K-2)) % MOD
    print(ans)


if __name__ == "__main__":
    main() MOD = 10**9 + 7 MOD 10**9 + 7 10**9 10 9 7 MAX = int(2e5) MAX int(2e5) int 2e5 def div(a, b):
    return a * pow(b, MOD-2, MOD) % MOD div return a * pow(b, MOD-2, MOD) % MOD a * pow(b, MOD-2, MOD) % MOD a * pow(b, MOD-2, MOD) a pow(b, MOD-2, MOD) pow b MOD-2 MOD 2 MOD MOD a a b b FACT = [1] * (MAX+1) FACT [1] * (MAX+1) [1] 1 MAX+1 MAX 1 for i in range(1, MAX+1):
    FACT[i] = (i * FACT[i-1]) % MOD i range(1, MAX+1) range 1 MAX+1 MAX 1 FACT[i] = (i * FACT[i-1]) % MOD FACT[i] FACT i (i * FACT[i-1]) % MOD i * FACT[i-1] i FACT[i-1] FACT i-1 i 1 MOD INV = [1] * (MAX+1) INV [1] * (MAX+1) [1] 1 MAX+1 MAX 1 INV[MAX] = div(1, FACT[MAX]) INV[MAX] INV MAX div(1, FACT[MAX]) div 1 FACT[MAX] FACT MAX for i in range(MAX, 0, -1):
    INV[i-1] = (INV[i] * i) % MOD i range(MAX, 0, -1) range MAX 0 -1 INV[i-1] = (INV[i] * i) % MOD INV[i-1] INV i-1 i 1 (INV[i] * i) % MOD INV[i] * i INV[i] INV i i MOD def combination(r, c):
    return FACT[r] * INV[r-c] * INV[c] combination return FACT[r] * INV[r-c] * INV[c] FACT[r] * INV[r-c] * INV[c] FACT[r] * INV[r-c] FACT[r] FACT r INV[r-c] INV r-c r c INV[c] INV c r r c c def main():
    N, M, K = map(int, input().split())
    ans1 = 0
    for d in range(1, N):
        ans1 = (ans1 + d * (N-d) * (M**2)) % MOD
    ans2 = 0
    for d in range(1, M):
        ans2 = (ans2 + d * (M-d) * (N**2)) % MOD
    ans = ((ans1 + ans2) * combination(M*N-2, K-2)) % 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 ans1 = 0 ans1 0 for d in range(1, N):
        ans1 = (ans1 + d * (N-d) * (M**2)) % MOD
     d range(1, N) range 1 N ans1 = (ans1 + d * (N-d) * (M**2)) % MOD ans1 (ans1 + d * (N-d) * (M**2)) % MOD ans1 + d * (N-d) * (M**2) ans1 d * (N-d) * (M**2) d * (N-d) d N-d N d M**2 M 2 MOD ans2 = 0 ans2 0 for d in range(1, M):
        ans2 = (ans2 + d * (M-d) * (N**2)) % MOD
     d range(1, M) range 1 M ans2 = (ans2 + d * (M-d) * (N**2)) % MOD ans2 (ans2 + d * (M-d) * (N**2)) % MOD ans2 + d * (M-d) * (N**2) ans2 d * (M-d) * (N**2) d * (M-d) d M-d M d N**2 N 2 MOD ans = ((ans1 + ans2) * combination(M*N-2, K-2)) % MOD ans ((ans1 + ans2) * combination(M*N-2, K-2)) % MOD (ans1 + ans2) * combination(M*N-2, K-2) ans1 + ans2 ans1 ans2 combination(M*N-2, K-2) combination M*N-2 M*N M N 2 K-2 K 2 MOD print(ans) print ans if __name__ == "__main__":
    main() __name__ == "__main__" __name__ "__main__" main() main def div(a, b):
    return a * pow(b, MOD-2, MOD) % MOD def div(a, b):
    return a * pow(b, MOD-2, MOD) % MOD div def combination(r, c):
    return FACT[r] * INV[r-c] * INV[c] def combination(r, c):
    return FACT[r] * INV[r-c] * INV[c] combination def main():
    N, M, K = map(int, input().split())
    ans1 = 0
    for d in range(1, N):
        ans1 = (ans1 + d * (N-d) * (M**2)) % MOD
    ans2 = 0
    for d in range(1, M):
        ans2 = (ans2 + d * (M-d) * (N**2)) % MOD
    ans = ((ans1 + ans2) * combination(M*N-2, K-2)) % MOD
    print(ans) def main():
    N, M, K = map(int, input().split())
    ans1 = 0
    for d in range(1, N):
        ans1 = (ans1 + d * (N-d) * (M**2)) % MOD
    ans2 = 0
    for d in range(1, M):
        ans2 = (ans2 + d * (M-d) * (N**2)) % MOD
    ans = ((ans1 + ans2) * combination(M*N-2, K-2)) % MOD
    print(ans) main INV = [1] * (MAX+1) [1] * (MAX+1) INV MOD = 10**9 + 7 10**9 + 7 MOD MAX = int(2e5) int(2e5) MAX FACT = [1] * (MAX+1) [1] * (MAX+1) FACT
MOD = 10**9 + 7
MAX = int(2e5)


def div(a, b):
    return a * pow(b, MOD-2, MOD) % MOD


FACT = [1] * (MAX+1)
for i in range(1, MAX+1):
    FACT[i] = (i * FACT[i-1]) % MOD
INV = [1] * (MAX+1)
INV[MAX] = div(1, FACT[MAX])
for i in range(MAX, 0, -1):
    INV[i-1] = (INV[i] * i) % MOD


def combination(r, c):
    return FACT[r] * INV[r-c] * INV[c]


def main():
    N, M, K = map(int, input().split())
    ans1 = 0
    for d in range(1, N):
        ans1 = (ans1 + d * (N-d) * (M**2)) % MOD
    ans2 = 0
    for d in range(1, M):
        ans2 = (ans2 + d * (M-d) * (N**2)) % MOD
    ans = ((ans1 + ans2) * combination(M*N-2, K-2)) % MOD
    print(ans)


if __name__ == "__main__":
    main()
