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

print((n*m*(m-1)*(m+1)*k*(k-1)*cmb(n*m,k)//(6*m*(n*m-1))+m*n*(n-1)*(n+1)*k*(k-1)*cmb(n*m,k)//(6*n*(n*m-1)))%(10**9+7)) 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 print((n*m*(m-1)*(m+1)*k*(k-1)*cmb(n*m,k)//(6*m*(n*m-1))+m*n*(n-1)*(n+1)*k*(k-1)*cmb(n*m,k)//(6*n*(n*m-1)))%(10**9+7)) print (n*m*(m-1)*(m+1)*k*(k-1)*cmb(n*m,k)//(6*m*(n*m-1))+m*n*(n-1)*(n+1)*k*(k-1)*cmb(n*m,k)//(6*n*(n*m-1)))%(10**9+7) n*m*(m-1)*(m+1)*k*(k-1)*cmb(n*m,k)//(6*m*(n*m-1))+m*n*(n-1)*(n+1)*k*(k-1)*cmb(n*m,k)//(6*n*(n*m-1)) n*m*(m-1)*(m+1)*k*(k-1)*cmb(n*m,k)//(6*m*(n*m-1)) n*m*(m-1)*(m+1)*k*(k-1)*cmb(n*m,k) n*m*(m-1)*(m+1)*k*(k-1) n*m*(m-1)*(m+1)*k n*m*(m-1)*(m+1) n*m*(m-1) n*m n m m-1 m 1 m+1 m 1 k k-1 k 1 cmb(n*m,k) cmb n*m n m k 6*m*(n*m-1) 6*m 6 m n*m-1 n*m n m 1 m*n*(n-1)*(n+1)*k*(k-1)*cmb(n*m,k)//(6*n*(n*m-1)) m*n*(n-1)*(n+1)*k*(k-1)*cmb(n*m,k) m*n*(n-1)*(n+1)*k*(k-1) m*n*(n-1)*(n+1)*k m*n*(n-1)*(n+1) m*n*(n-1) m*n m n n-1 n 1 n+1 n 1 k k-1 k 1 cmb(n*m,k) cmb n*m n m k 6*n*(n*m-1) 6*n 6 n n*m-1 n*m n m 1 10**9+7 10**9 10 9 7 n,m,k=map(int,input().split()) map(int,input().split()) n 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 m,k=map(int,input().split()) map(int,input().split()) m k=map(int,input().split()) map(int,input().split()) k
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

print((n*m*(m-1)*(m+1)*k*(k-1)*cmb(n*m,k)//(6*m*(n*m-1))+m*n*(n-1)*(n+1)*k*(k-1)*cmb(n*m,k)//(6*n*(n*m-1)))%(10**9+7))