# 1 つの組を固定したとき、その他の置き方は (N*M-2)C(K-2) 通り
# x 座標が h 離れる組み合わせは、(N-h)*M*M 通り (h!=0)

def combination(n, r, mod=10**9+7):
    # nCr mod m
    # rがn/2に近いと非常に重くなる
    n1, r = n+1, min(r, n-r)
    numer = denom = 1
    for i in range(1, r+1):
        numer = numer * (n1-i) % mod
        denom = denom * i % mod
    return numer * pow(denom, mod-2, mod) % mod

def main():
    N, M, K = map(int, input().split())
    mod = 10**9 + 7
    ans1 = 0
    for h in range(1, N):
        ans1 += (N - h) * h
    ans1 = ans1 * M * M % mod
    ans2 = 0
    for w in range(1, M):
        ans2 += (M - w) * w
    ans2 = ans2 * N * N % mod
    ans = (ans1 + ans2) * combination(N*M-2, K-2) % mod
    print(ans)

main() def combination(n, r, mod=10**9+7):
    # nCr mod m
    # rがn/2に近いと非常に重くなる
    n1, r = n+1, min(r, n-r)
    numer = denom = 1
    for i in range(1, r+1):
        numer = numer * (n1-i) % mod
        denom = denom * i % mod
    return numer * pow(denom, mod-2, mod) % mod combination n1, r = n+1, min(r, n-r) n1 n+1 n 1 r min(r, n-r) min r n-r n r numer = denom = 1 numer 1 = denom = 1 denom 1 for i in range(1, r+1):
        numer = numer * (n1-i) % mod
        denom = denom * i % mod
     i range(1, r+1) range 1 r+1 r 1 numer = numer * (n1-i) % mod numer numer * (n1-i) % mod numer * (n1-i) numer n1-i n1 i mod denom = denom * i % mod denom denom * i % mod denom * i denom i mod return numer * pow(denom, mod-2, mod) % mod numer * pow(denom, mod-2, mod) % mod numer * pow(denom, mod-2, mod) numer pow(denom, mod-2, mod) pow denom mod-2 mod 2 mod mod n n r r mod=10**9+7 mod 10**9+7 10**9 10 9 7 def main():
    N, M, K = map(int, input().split())
    mod = 10**9 + 7
    ans1 = 0
    for h in range(1, N):
        ans1 += (N - h) * h
    ans1 = ans1 * M * M % mod
    ans2 = 0
    for w in range(1, M):
        ans2 += (M - w) * w
    ans2 = ans2 * N * N % mod
    ans = (ans1 + ans2) * combination(N*M-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 mod = 10**9 + 7 mod 10**9 + 7 10**9 10 9 7 ans1 = 0 ans1 0 for h in range(1, N):
        ans1 += (N - h) * h
     h range(1, N) range 1 N ans1 += (N - h) * h ans1 (N - h) * h N - h N h h ans1 = ans1 * M * M % mod ans1 ans1 * M * M % mod ans1 * M * M ans1 * M ans1 M M mod ans2 = 0 ans2 0 for w in range(1, M):
        ans2 += (M - w) * w
     w range(1, M) range 1 M ans2 += (M - w) * w ans2 (M - w) * w M - w M w w ans2 = ans2 * N * N % mod ans2 ans2 * N * N % mod ans2 * N * N ans2 * N ans2 N N mod ans = (ans1 + ans2) * combination(N*M-2, K-2) % mod ans (ans1 + ans2) * combination(N*M-2, K-2) % mod (ans1 + ans2) * combination(N*M-2, K-2) ans1 + ans2 ans1 ans2 combination(N*M-2, K-2) combination N*M-2 N*M N M 2 K-2 K 2 mod print(ans) print ans main() main def combination(n, r, mod=10**9+7):
    # nCr mod m
    # rがn/2に近いと非常に重くなる
    n1, r = n+1, min(r, n-r)
    numer = denom = 1
    for i in range(1, r+1):
        numer = numer * (n1-i) % mod
        denom = denom * i % mod
    return numer * pow(denom, mod-2, mod) % mod def combination(n, r, mod=10**9+7):
    # nCr mod m
    # rがn/2に近いと非常に重くなる
    n1, r = n+1, min(r, n-r)
    numer = denom = 1
    for i in range(1, r+1):
        numer = numer * (n1-i) % mod
        denom = denom * i % mod
    return numer * pow(denom, mod-2, mod) % mod combination def main():
    N, M, K = map(int, input().split())
    mod = 10**9 + 7
    ans1 = 0
    for h in range(1, N):
        ans1 += (N - h) * h
    ans1 = ans1 * M * M % mod
    ans2 = 0
    for w in range(1, M):
        ans2 += (M - w) * w
    ans2 = ans2 * N * N % mod
    ans = (ans1 + ans2) * combination(N*M-2, K-2) % mod
    print(ans) def main():
    N, M, K = map(int, input().split())
    mod = 10**9 + 7
    ans1 = 0
    for h in range(1, N):
        ans1 += (N - h) * h
    ans1 = ans1 * M * M % mod
    ans2 = 0
    for w in range(1, M):
        ans2 += (M - w) * w
    ans2 = ans2 * N * N % mod
    ans = (ans1 + ans2) * combination(N*M-2, K-2) % mod
    print(ans) main
# 1 つの組を固定したとき、その他の置き方は (N*M-2)C(K-2) 通り
# x 座標が h 離れる組み合わせは、(N-h)*M*M 通り (h!=0)

def combination(n, r, mod=10**9+7):
    # nCr mod m
    # rがn/2に近いと非常に重くなる
    n1, r = n+1, min(r, n-r)
    numer = denom = 1
    for i in range(1, r+1):
        numer = numer * (n1-i) % mod
        denom = denom * i % mod
    return numer * pow(denom, mod-2, mod) % mod

def main():
    N, M, K = map(int, input().split())
    mod = 10**9 + 7
    ans1 = 0
    for h in range(1, N):
        ans1 += (N - h) * h
    ans1 = ans1 * M * M % mod
    ans2 = 0
    for w in range(1, M):
        ans2 += (M - w) * w
    ans2 = ans2 * N * N % mod
    ans = (ans1 + ans2) * combination(N*M-2, K-2) % mod
    print(ans)

main()
