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
N,M,K=map(int,input().split())
retu=0
gyou=0
for i in range(1,M):
    retu+=i*(M-i)*N*N
for j in range(1,N):
    gyou+=j*(N-j)*M*M
cost=retu+gyou
num=cmb(N*M-2,K-2)%mod
ans=int((num*(cost %mod))%mod)
print(ans) 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 r=n-r 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 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 N,M,K=map(int,input().split()) N map(int,input().split()) map int input().split() ().split () input split M K retu=0 retu 0 gyou=0 gyou 0 for i in range(1,M):
    retu+=i*(M-i)*N*N i range(1,M) range 1 M retu+=i*(M-i)*N*N retu i*(M-i)*N*N i*(M-i)*N i*(M-i) i M-i M i N N for j in range(1,N):
    gyou+=j*(N-j)*M*M j range(1,N) range 1 N gyou+=j*(N-j)*M*M gyou j*(N-j)*M*M j*(N-j)*M j*(N-j) j N-j N j M M cost=retu+gyou cost retu+gyou retu gyou num=cmb(N*M-2,K-2)%mod num 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 ans=int((num*(cost %mod))%mod) ans int((num*(cost %mod))%mod) int (num*(cost %mod))%mod num*(cost %mod) num cost %mod cost mod mod print(ans) print ans 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 K=map(int,input().split()) map(int,input().split()) K num=cmb(N*M-2,K-2)%mod cmb(N*M-2,K-2)%mod num gyou=0 0 gyou ans=int((num*(cost %mod))%mod) int((num*(cost %mod))%mod) ans mod=10**9+7 10**9+7 mod M,K=map(int,input().split()) map(int,input().split()) M retu=0 0 retu retu+=i*(M-i)*N*N i*(M-i)*N*N retu N,M,K=map(int,input().split()) map(int,input().split()) N gyou+=j*(N-j)*M*M j*(N-j)*M*M gyou cost=retu+gyou retu+gyou cost
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
N,M,K=map(int,input().split())
retu=0
gyou=0
for i in range(1,M):
    retu+=i*(M-i)*N*N
for j in range(1,N):
    gyou+=j*(N-j)*M*M
cost=retu+gyou
num=cmb(N*M-2,K-2)%mod
ans=int((num*(cost %mod))%mod)
print(ans)