import sys, math, collections, heapq, itertools
F = sys.stdin
def single_input(): return F.readline().strip("\n")
def line_input(): return F.readline().strip("\n").split()
mod = 7 + 10 ** 9
factorial = [1] * (2 * 10 ** 5 + 1)
for i in range(1, 2 * 10 ** 5 + 1):
    factorial[i] = (factorial[i-1] * i) % mod
revfactorial = [1] * (2 * 10 ** 5 + 1)
revfactorial[-1] = pow(factorial[-1], mod - 2, mod)
for i in reversed(range(1, 2 * 10**5)):
    revfactorial[i] = (revfactorial[i+1] * (i+1)) % mod

def comb(n, r):
    return (factorial[n] * revfactorial[n-r] * revfactorial[r]) % mod

def solve():
    N, M, K = map(int, line_input())
    xsum, ysum = 0, 0
    for i in range(1, N): #xsum. (pairの取り方)  * d
        xsum += ((N - i) * M * M * i) % mod
        xsum %= mod
    for j in range(1, M):
        ysum += ((M - j) * N * N * j) % mod
        ysum %= mod
    print(((xsum + ysum) * comb(N*M-2, K-2)) % mod)
    return 0
  
if __name__ == "__main__":
    solve() import sys, math, collections, heapq, itertools sys math collections heapq itertools F = sys.stdin F sys.stdin sys stdin def single_input(): return F.readline().strip("\n") single_input def line_input(): return F.readline().strip("\n").split() line_input mod = 7 + 10 ** 9 mod 7 + 10 ** 9 7 10 ** 9 10 9 factorial = [1] * (2 * 10 ** 5 + 1) factorial [1] * (2 * 10 ** 5 + 1) [1] 1 2 * 10 ** 5 + 1 2 * 10 ** 5 2 10 ** 5 10 5 1 for i in range(1, 2 * 10 ** 5 + 1):
    factorial[i] = (factorial[i-1] * i) % mod i range(1, 2 * 10 ** 5 + 1) range 1 2 * 10 ** 5 + 1 2 * 10 ** 5 2 10 ** 5 10 5 1 factorial[i] = (factorial[i-1] * i) % mod factorial[i] factorial i (factorial[i-1] * i) % mod factorial[i-1] * i factorial[i-1] factorial i-1 i 1 i mod revfactorial = [1] * (2 * 10 ** 5 + 1) revfactorial [1] * (2 * 10 ** 5 + 1) [1] 1 2 * 10 ** 5 + 1 2 * 10 ** 5 2 10 ** 5 10 5 1 revfactorial[-1] = pow(factorial[-1], mod - 2, mod) revfactorial[-1] revfactorial -1 pow(factorial[-1], mod - 2, mod) pow factorial[-1] factorial -1 mod - 2 mod 2 mod for i in reversed(range(1, 2 * 10**5)):
    revfactorial[i] = (revfactorial[i+1] * (i+1)) % mod i reversed(range(1, 2 * 10**5)) reversed range(1, 2 * 10**5) range 1 2 * 10**5 2 10**5 10 5 revfactorial[i] = (revfactorial[i+1] * (i+1)) % mod revfactorial[i] revfactorial i (revfactorial[i+1] * (i+1)) % mod revfactorial[i+1] * (i+1) revfactorial[i+1] revfactorial i+1 i 1 i+1 i 1 mod def comb(n, r):
    return (factorial[n] * revfactorial[n-r] * revfactorial[r]) % mod comb return (factorial[n] * revfactorial[n-r] * revfactorial[r]) % mod (factorial[n] * revfactorial[n-r] * revfactorial[r]) % mod factorial[n] * revfactorial[n-r] * revfactorial[r] factorial[n] * revfactorial[n-r] factorial[n] factorial n revfactorial[n-r] revfactorial n-r n r revfactorial[r] revfactorial r mod n n r r def solve():
    N, M, K = map(int, line_input())
    xsum, ysum = 0, 0
    for i in range(1, N): #xsum. (pairの取り方)  * d
        xsum += ((N - i) * M * M * i) % mod
        xsum %= mod
    for j in range(1, M):
        ysum += ((M - j) * N * N * j) % mod
        ysum %= mod
    print(((xsum + ysum) * comb(N*M-2, K-2)) % mod)
    return 0
   solve N, M, K = map(int, line_input()) N map(int, line_input()) map int line_input() line_input M K xsum, ysum = 0, 0 xsum 0 ysum 0 for i in range(1, N): #xsum. (pairの取り方)  * d
        xsum += ((N - i) * M * M * i) % mod
        xsum %= mod
     i range(1, N) range 1 N xsum += ((N - i) * M * M * i) % mod xsum ((N - i) * M * M * i) % mod (N - i) * M * M * i (N - i) * M * M (N - i) * M N - i N i M M i mod xsum %= mod xsum mod for j in range(1, M):
        ysum += ((M - j) * N * N * j) % mod
        ysum %= mod
     j range(1, M) range 1 M ysum += ((M - j) * N * N * j) % mod ysum ((M - j) * N * N * j) % mod (M - j) * N * N * j (M - j) * N * N (M - j) * N M - j M j N N j mod ysum %= mod ysum mod print(((xsum + ysum) * comb(N*M-2, K-2)) % mod) print ((xsum + ysum) * comb(N*M-2, K-2)) % mod (xsum + ysum) * comb(N*M-2, K-2) xsum + ysum xsum ysum comb(N*M-2, K-2) comb N*M-2 N*M N M 2 K-2 K 2 mod return 0 0 if __name__ == "__main__":
    solve() __name__ == "__main__" __name__ "__main__" solve() solve def single_input(): return F.readline().strip("\n") def single_input(): return F.readline().strip("\n") single_input factorial = [1] * (2 * 10 ** 5 + 1) [1] * (2 * 10 ** 5 + 1) factorial def solve():
    N, M, K = map(int, line_input())
    xsum, ysum = 0, 0
    for i in range(1, N): #xsum. (pairの取り方)  * d
        xsum += ((N - i) * M * M * i) % mod
        xsum %= mod
    for j in range(1, M):
        ysum += ((M - j) * N * N * j) % mod
        ysum %= mod
    print(((xsum + ysum) * comb(N*M-2, K-2)) % mod)
    return 0
   def solve():
    N, M, K = map(int, line_input())
    xsum, ysum = 0, 0
    for i in range(1, N): #xsum. (pairの取り方)  * d
        xsum += ((N - i) * M * M * i) % mod
        xsum %= mod
    for j in range(1, M):
        ysum += ((M - j) * N * N * j) % mod
        ysum %= mod
    print(((xsum + ysum) * comb(N*M-2, K-2)) % mod)
    return 0
   solve def comb(n, r):
    return (factorial[n] * revfactorial[n-r] * revfactorial[r]) % mod def comb(n, r):
    return (factorial[n] * revfactorial[n-r] * revfactorial[r]) % mod comb def line_input(): return F.readline().strip("\n").split() def line_input(): return F.readline().strip("\n").split() line_input F = sys.stdin sys.stdin F mod = 7 + 10 ** 9 7 + 10 ** 9 mod revfactorial = [1] * (2 * 10 ** 5 + 1) [1] * (2 * 10 ** 5 + 1) revfactorial
import sys, math, collections, heapq, itertools
F = sys.stdin
def single_input(): return F.readline().strip("\n")
def line_input(): return F.readline().strip("\n").split()
mod = 7 + 10 ** 9
factorial = [1] * (2 * 10 ** 5 + 1)
for i in range(1, 2 * 10 ** 5 + 1):
    factorial[i] = (factorial[i-1] * i) % mod
revfactorial = [1] * (2 * 10 ** 5 + 1)
revfactorial[-1] = pow(factorial[-1], mod - 2, mod)
for i in reversed(range(1, 2 * 10**5)):
    revfactorial[i] = (revfactorial[i+1] * (i+1)) % mod

def comb(n, r):
    return (factorial[n] * revfactorial[n-r] * revfactorial[r]) % mod

def solve():
    N, M, K = map(int, line_input())
    xsum, ysum = 0, 0
    for i in range(1, N): #xsum. (pairの取り方)  * d
        xsum += ((N - i) * M * M * i) % mod
        xsum %= mod
    for j in range(1, M):
        ysum += ((M - j) * N * N * j) % mod
        ysum %= mod
    print(((xsum + ysum) * comb(N*M-2, K-2)) % mod)
    return 0
  
if __name__ == "__main__":
    solve()