mod = 1000000007
import sys
input = sys.stdin.readline
N, M, K = map(int, input().split())


def cmb(n, r):
    if n<0 or r<0 or r>n:
        return None
    r = min(r, n-r)
    if r == 0:
        return 1
    if r == 1:
        return n
    numerator = [0]*r
    denominator = [0]*r
    for k in range(r):
        numerator[k] = n-r+k+1
        denominator[k] = k+1
    for p in range(2, r+1):
        pivot = denominator[p-1]
        if pivot > 1:
            offset = (n-r) % p
            for k in range(p-1, r, p):
                numerator[k-offset] //= pivot
                denominator[k] //= pivot
    res = 1
    for n in numerator:
        if n > 1:
            res *= n
    return res

N2 = N**2
M2 = M**2
Xpattern = [(x * (N-x)) % mod for x in range(N)]
Ypattern = [(y * (M-y)) % mod for y in range(M)]
coef = cmb(N*M-2, K-2)

print(((sum(Xpattern)*M2+sum(Ypattern)*N2)*coef)%mod) mod = 1000000007 mod 1000000007 import sys sys input = sys.stdin.readline input sys.stdin.readline sys.stdin sys stdin readline N, M, K = map(int, input().split()) N map(int, input().split()) map int input().split() ().split () input split M K def cmb(n, r):
    if n<0 or r<0 or r>n:
        return None
    r = min(r, n-r)
    if r == 0:
        return 1
    if r == 1:
        return n
    numerator = [0]*r
    denominator = [0]*r
    for k in range(r):
        numerator[k] = n-r+k+1
        denominator[k] = k+1
    for p in range(2, r+1):
        pivot = denominator[p-1]
        if pivot > 1:
            offset = (n-r) % p
            for k in range(p-1, r, p):
                numerator[k-offset] //= pivot
                denominator[k] //= pivot
    res = 1
    for n in numerator:
        if n > 1:
            res *= n
    return res cmb if n<0 or r<0 or r>n:
        return None
     n<0 or r<0 or r>n n<0 or r<0 n<0 n 0 r<0 r 0 r>n r n return None None r = min(r, n-r) r min(r, n-r) min r n-r n r if r == 0:
        return 1
     r == 0 r 0 return 1 1 if r == 1:
        return n
     r == 1 r 1 return n n numerator = [0]*r numerator [0]*r [0] 0 r denominator = [0]*r denominator [0]*r [0] 0 r for k in range(r):
        numerator[k] = n-r+k+1
        denominator[k] = k+1
     k range(r) range r numerator[k] = n-r+k+1 numerator[k] numerator k n-r+k+1 n-r+k n-r n r k 1 denominator[k] = k+1 denominator[k] denominator k k+1 k 1 for p in range(2, r+1):
        pivot = denominator[p-1]
        if pivot > 1:
            offset = (n-r) % p
            for k in range(p-1, r, p):
                numerator[k-offset] //= pivot
                denominator[k] //= pivot
     p range(2, r+1) range 2 r+1 r 1 pivot = denominator[p-1] pivot denominator[p-1] denominator p-1 p 1 if pivot > 1:
            offset = (n-r) % p
            for k in range(p-1, r, p):
                numerator[k-offset] //= pivot
                denominator[k] //= pivot
     pivot > 1 pivot 1 offset = (n-r) % p offset (n-r) % p n-r n r p for k in range(p-1, r, p):
                numerator[k-offset] //= pivot
                denominator[k] //= pivot
     k range(p-1, r, p) range p-1 p 1 r p numerator[k-offset] //= pivot numerator[k-offset] numerator k-offset k offset pivot denominator[k] //= pivot denominator[k] denominator k pivot res = 1 res 1 for n in numerator:
        if n > 1:
            res *= n
     n numerator if n > 1:
            res *= n
     n > 1 n 1 res *= n res n return res res n n r r N2 = N**2 N2 N**2 N 2 M2 = M**2 M2 M**2 M 2 (x * (N-x)) % mod for x in range(N) for x in range(N) x range(N) range N for x in range(N) (x * (N-x)) % mod x * (N-x) x N-x N x mod Xpattern = [(x * (N-x)) % mod for x in range(N)] Xpattern [(x * (N-x)) % mod for x in range(N)] (y * (M-y)) % mod for y in range(M) for y in range(M) y range(M) range M for y in range(M) (y * (M-y)) % mod y * (M-y) y M-y M y mod Ypattern = [(y * (M-y)) % mod for y in range(M)] Ypattern [(y * (M-y)) % mod for y in range(M)] coef = cmb(N*M-2, K-2) coef cmb(N*M-2, K-2) cmb N*M-2 N*M N M 2 K-2 K 2 print(((sum(Xpattern)*M2+sum(Ypattern)*N2)*coef)%mod) print ((sum(Xpattern)*M2+sum(Ypattern)*N2)*coef)%mod (sum(Xpattern)*M2+sum(Ypattern)*N2)*coef sum(Xpattern)*M2+sum(Ypattern)*N2 sum(Xpattern)*M2 sum(Xpattern) sum Xpattern M2 sum(Ypattern)*N2 sum(Ypattern) sum Ypattern N2 coef mod coef = cmb(N*M-2, K-2) cmb(N*M-2, K-2) coef N2 = N**2 N**2 N2 Ypattern = [(y * (M-y)) % mod for y in range(M)] [(y * (M-y)) % mod for y in range(M)] Ypattern mod = 1000000007 1000000007 mod def cmb(n, r):
    if n<0 or r<0 or r>n:
        return None
    r = min(r, n-r)
    if r == 0:
        return 1
    if r == 1:
        return n
    numerator = [0]*r
    denominator = [0]*r
    for k in range(r):
        numerator[k] = n-r+k+1
        denominator[k] = k+1
    for p in range(2, r+1):
        pivot = denominator[p-1]
        if pivot > 1:
            offset = (n-r) % p
            for k in range(p-1, r, p):
                numerator[k-offset] //= pivot
                denominator[k] //= pivot
    res = 1
    for n in numerator:
        if n > 1:
            res *= n
    return res def cmb(n, r):
    if n<0 or r<0 or r>n:
        return None
    r = min(r, n-r)
    if r == 0:
        return 1
    if r == 1:
        return n
    numerator = [0]*r
    denominator = [0]*r
    for k in range(r):
        numerator[k] = n-r+k+1
        denominator[k] = k+1
    for p in range(2, r+1):
        pivot = denominator[p-1]
        if pivot > 1:
            offset = (n-r) % p
            for k in range(p-1, r, p):
                numerator[k-offset] //= pivot
                denominator[k] //= pivot
    res = 1
    for n in numerator:
        if n > 1:
            res *= n
    return res cmb input = sys.stdin.readline sys.stdin.readline input N, M, K = map(int, input().split()) map(int, input().split()) N K = map(int, input().split()) map(int, input().split()) K Xpattern = [(x * (N-x)) % mod for x in range(N)] [(x * (N-x)) % mod for x in range(N)] Xpattern M2 = M**2 M**2 M2 M, K = map(int, input().split()) map(int, input().split()) M
mod = 1000000007
import sys
input = sys.stdin.readline
N, M, K = map(int, input().split())


def cmb(n, r):
    if n<0 or r<0 or r>n:
        return None
    r = min(r, n-r)
    if r == 0:
        return 1
    if r == 1:
        return n
    numerator = [0]*r
    denominator = [0]*r
    for k in range(r):
        numerator[k] = n-r+k+1
        denominator[k] = k+1
    for p in range(2, r+1):
        pivot = denominator[p-1]
        if pivot > 1:
            offset = (n-r) % p
            for k in range(p-1, r, p):
                numerator[k-offset] //= pivot
                denominator[k] //= pivot
    res = 1
    for n in numerator:
        if n > 1:
            res *= n
    return res

N2 = N**2
M2 = M**2
Xpattern = [(x * (N-x)) % mod for x in range(N)]
Ypattern = [(y * (M-y)) % mod for y in range(M)]
coef = cmb(N*M-2, K-2)

print(((sum(Xpattern)*M2+sum(Ypattern)*N2)*coef)%mod)