n,m,k=map(int,input().split())

def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    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

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

mod=10**9+7
a=cmb(n*m-2,k-2)%mod
res=0
for d in range(1,n):
	res+=(d*(n-d)*m**2*a)%mod
	res%=mod
for d in range(1,m):
	res+=(d*(m-d)*n**2*a)%mod
	res%=mod
print(res) 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 - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    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

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result cmb if n - r < r: r = n - r
     n - r < r n - r n r r if r == 0: return 1
     r == 0 r 0 if r == 1: return n

     r == 1 r 1 n - r + k + 1 for k in range(r) for k in range(r) k range(r) range r for k in range(r) n - r + k + 1 n - r + k n - r n r k 1 numerator = [n - r + k + 1 for k in range(r)] numerator [n - r + k + 1 for k in range(r)] k + 1 for k in range(r) for k in range(r) k range(r) range r for k in range(r) k + 1 k 1 denominator = [k + 1 for k in range(r)] denominator [k + 1 for k in range(r)] 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 result = 1 result 1 for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

     k range(r) range r if numerator[k] > 1:
            result *= int(numerator[k])

     numerator[k] > 1 numerator[k] numerator k 1 result *= int(numerator[k]) result int(numerator[k]) int numerator[k] numerator k return result result n n r r mod=10**9+7 mod 10**9+7 10**9 10 9 7 a=cmb(n*m-2,k-2)%mod a cmb(n*m-2,k-2)%mod cmb(n*m-2,k-2) cmb n*m-2 n*m n m 2 k-2 k 2 mod res=0 res 0 for d in range(1,n):
	res+=(d*(n-d)*m**2*a)%mod
	res%=mod d range(1,n) range 1 n res+=(d*(n-d)*m**2*a)%mod res (d*(n-d)*m**2*a)%mod d*(n-d)*m**2*a d*(n-d)*m**2 d*(n-d) d n-d n d m**2 m 2 a mod res%=mod res mod for d in range(1,m):
	res+=(d*(m-d)*n**2*a)%mod
	res%=mod d range(1,m) range 1 m res+=(d*(m-d)*n**2*a)%mod res (d*(m-d)*n**2*a)%mod d*(m-d)*n**2*a d*(m-d)*n**2 d*(m-d) d m-d m d n**2 n 2 a mod res%=mod res mod print(res) print res res%=mod mod res res=0 0 res a=cmb(n*m-2,k-2)%mod cmb(n*m-2,k-2)%mod a k=map(int,input().split()) map(int,input().split()) k n,m,k=map(int,input().split()) map(int,input().split()) n res%=mod mod res m,k=map(int,input().split()) map(int,input().split()) m def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    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

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    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

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result cmb mod=10**9+7 10**9+7 mod res+=(d*(n-d)*m**2*a)%mod (d*(n-d)*m**2*a)%mod res res+=(d*(m-d)*n**2*a)%mod (d*(m-d)*n**2*a)%mod res
n,m,k=map(int,input().split())

def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    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

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

mod=10**9+7
a=cmb(n*m-2,k-2)%mod
res=0
for d in range(1,n):
	res+=(d*(n-d)*m**2*a)%mod
	res%=mod
for d in range(1,m):
	res+=(d*(m-d)*n**2*a)%mod
	res%=mod
print(res)