n,m,k=map(int,input().split())
ans=0
INF=10**9+7
if n<=m:
    M=-(m-1)*m*(2*m-1)//3+m*m*(m-1)
    Ms=m*m*(m-1)//2-(m-1)*m*(2*m-1)//6
    M=M%INF
    Ms=Ms%INF
    for i in range(1,n+1):
        for j in range(i,n+1):
            if i==j:
                ans=ans+Ms
            else:
                d=j-i
                ans=ans+d*m**2+M
            ans=ans%INF
else:
    (n,m)=(m,n)
    M=-(m-1)*m*(2*m-1)//3+m*m*(m-1)
    Ms=m*m*(m-1)//2-(m-1)*m*(2*m-1)//6
    M=M%INF
    Ms=Ms%INF
    for i in range(1,n+1):
        for j in range(i,n+1):
            if i==j:
                ans=ans+Ms
            else:
                d=j-i
                ans=ans+d*m**2+M
            ans=ans%INF
def modcomb(n,k,m):
    fac=[0]*(n+1)
    finv=[0]*(n+1)
    inv=[0]*(n+1)
    fac[0]=fac[1]=1
    finv[0]=finv[1]=1
    inv[1]=1
    for i in range(2,n+1):
        fac[i]=fac[i-1]*i%m
        inv[i]=m-inv[m%i]*(m//i)%m
        finv[i]=finv[i-1]*inv[i]%m
    return fac[n]*(finv[k]*finv[n-k]%m)%m
ans=ans*modcomb(n*m-2,k-2,INF)%INF
print(ans)
 n,m,k=map(int,input().split()) n map(int,input().split()) map int input().split() ().split () input split m k ans=0 ans 0 INF=10**9+7 INF 10**9+7 10**9 10 9 7 if n<=m:
    M=-(m-1)*m*(2*m-1)//3+m*m*(m-1)
    Ms=m*m*(m-1)//2-(m-1)*m*(2*m-1)//6
    M=M%INF
    Ms=Ms%INF
    for i in range(1,n+1):
        for j in range(i,n+1):
            if i==j:
                ans=ans+Ms
            else:
                d=j-i
                ans=ans+d*m**2+M
            ans=ans%INF
else:
    (n,m)=(m,n)
    M=-(m-1)*m*(2*m-1)//3+m*m*(m-1)
    Ms=m*m*(m-1)//2-(m-1)*m*(2*m-1)//6
    M=M%INF
    Ms=Ms%INF
    for i in range(1,n+1):
        for j in range(i,n+1):
            if i==j:
                ans=ans+Ms
            else:
                d=j-i
                ans=ans+d*m**2+M
            ans=ans%INF n<=m n m M=-(m-1)*m*(2*m-1)//3+m*m*(m-1) M -(m-1)*m*(2*m-1)//3+m*m*(m-1) -(m-1)*m*(2*m-1)//3 -(m-1)*m*(2*m-1) -(m-1)*m -(m-1) m-1 m 1 m 2*m-1 2*m 2 m 1 3 m*m*(m-1) m*m m m m-1 m 1 Ms=m*m*(m-1)//2-(m-1)*m*(2*m-1)//6 Ms m*m*(m-1)//2-(m-1)*m*(2*m-1)//6 m*m*(m-1)//2 m*m*(m-1) m*m m m m-1 m 1 2 (m-1)*m*(2*m-1)//6 (m-1)*m*(2*m-1) (m-1)*m m-1 m 1 m 2*m-1 2*m 2 m 1 6 M=M%INF M M%INF M INF Ms=Ms%INF Ms Ms%INF Ms INF for i in range(1,n+1):
        for j in range(i,n+1):
            if i==j:
                ans=ans+Ms
            else:
                d=j-i
                ans=ans+d*m**2+M
            ans=ans%INF i range(1,n+1) range 1 n+1 n 1 for j in range(i,n+1):
            if i==j:
                ans=ans+Ms
            else:
                d=j-i
                ans=ans+d*m**2+M
            ans=ans%INF j range(i,n+1) range i n+1 n 1 if i==j:
                ans=ans+Ms
            else:
                d=j-i
                ans=ans+d*m**2+M
             i==j i j ans=ans+Ms ans ans+Ms ans Ms d=j-i d j-i j i ans=ans+d*m**2+M ans ans+d*m**2+M ans+d*m**2 ans d*m**2 d m**2 m 2 M ans=ans%INF ans ans%INF ans INF (n,m)=(m,n) (n,m) n m (m,n) m n M=-(m-1)*m*(2*m-1)//3+m*m*(m-1) M -(m-1)*m*(2*m-1)//3+m*m*(m-1) -(m-1)*m*(2*m-1)//3 -(m-1)*m*(2*m-1) -(m-1)*m -(m-1) m-1 m 1 m 2*m-1 2*m 2 m 1 3 m*m*(m-1) m*m m m m-1 m 1 Ms=m*m*(m-1)//2-(m-1)*m*(2*m-1)//6 Ms m*m*(m-1)//2-(m-1)*m*(2*m-1)//6 m*m*(m-1)//2 m*m*(m-1) m*m m m m-1 m 1 2 (m-1)*m*(2*m-1)//6 (m-1)*m*(2*m-1) (m-1)*m m-1 m 1 m 2*m-1 2*m 2 m 1 6 M=M%INF M M%INF M INF Ms=Ms%INF Ms Ms%INF Ms INF for i in range(1,n+1):
        for j in range(i,n+1):
            if i==j:
                ans=ans+Ms
            else:
                d=j-i
                ans=ans+d*m**2+M
            ans=ans%INF i range(1,n+1) range 1 n+1 n 1 for j in range(i,n+1):
            if i==j:
                ans=ans+Ms
            else:
                d=j-i
                ans=ans+d*m**2+M
            ans=ans%INF j range(i,n+1) range i n+1 n 1 if i==j:
                ans=ans+Ms
            else:
                d=j-i
                ans=ans+d*m**2+M
             i==j i j ans=ans+Ms ans ans+Ms ans Ms d=j-i d j-i j i ans=ans+d*m**2+M ans ans+d*m**2+M ans+d*m**2 ans d*m**2 d m**2 m 2 M ans=ans%INF ans ans%INF ans INF def modcomb(n,k,m):
    fac=[0]*(n+1)
    finv=[0]*(n+1)
    inv=[0]*(n+1)
    fac[0]=fac[1]=1
    finv[0]=finv[1]=1
    inv[1]=1
    for i in range(2,n+1):
        fac[i]=fac[i-1]*i%m
        inv[i]=m-inv[m%i]*(m//i)%m
        finv[i]=finv[i-1]*inv[i]%m
    return fac[n]*(finv[k]*finv[n-k]%m)%m modcomb fac=[0]*(n+1) fac [0]*(n+1) [0] 0 n+1 n 1 finv=[0]*(n+1) finv [0]*(n+1) [0] 0 n+1 n 1 inv=[0]*(n+1) inv [0]*(n+1) [0] 0 n+1 n 1 fac[0]=fac[1]=1 fac[0] fac 0 1 =fac[1]=1 fac[1] fac 1 1 finv[0]=finv[1]=1 finv[0] finv 0 1 =finv[1]=1 finv[1] finv 1 1 inv[1]=1 inv[1] inv 1 1 for i in range(2,n+1):
        fac[i]=fac[i-1]*i%m
        inv[i]=m-inv[m%i]*(m//i)%m
        finv[i]=finv[i-1]*inv[i]%m
     i range(2,n+1) range 2 n+1 n 1 fac[i]=fac[i-1]*i%m fac[i] fac i fac[i-1]*i%m fac[i-1]*i fac[i-1] fac i-1 i 1 i m inv[i]=m-inv[m%i]*(m//i)%m inv[i] inv i m-inv[m%i]*(m//i)%m m inv[m%i]*(m//i)%m inv[m%i]*(m//i) inv[m%i] inv m%i m i m//i m i m finv[i]=finv[i-1]*inv[i]%m finv[i] finv i finv[i-1]*inv[i]%m finv[i-1]*inv[i] finv[i-1] finv i-1 i 1 inv[i] inv i m return fac[n]*(finv[k]*finv[n-k]%m)%m fac[n]*(finv[k]*finv[n-k]%m)%m fac[n]*(finv[k]*finv[n-k]%m) fac[n] fac n finv[k]*finv[n-k]%m finv[k]*finv[n-k] finv[k] finv k finv[n-k] finv n-k n k m m n n k k m m ans=ans*modcomb(n*m-2,k-2,INF)%INF ans ans*modcomb(n*m-2,k-2,INF)%INF ans*modcomb(n*m-2,k-2,INF) ans modcomb(n*m-2,k-2,INF) modcomb n*m-2 n*m n m 2 k-2 k 2 INF INF print(ans) print ans def modcomb(n,k,m):
    fac=[0]*(n+1)
    finv=[0]*(n+1)
    inv=[0]*(n+1)
    fac[0]=fac[1]=1
    finv[0]=finv[1]=1
    inv[1]=1
    for i in range(2,n+1):
        fac[i]=fac[i-1]*i%m
        inv[i]=m-inv[m%i]*(m//i)%m
        finv[i]=finv[i-1]*inv[i]%m
    return fac[n]*(finv[k]*finv[n-k]%m)%m def modcomb(n,k,m):
    fac=[0]*(n+1)
    finv=[0]*(n+1)
    inv=[0]*(n+1)
    fac[0]=fac[1]=1
    finv[0]=finv[1]=1
    inv[1]=1
    for i in range(2,n+1):
        fac[i]=fac[i-1]*i%m
        inv[i]=m-inv[m%i]*(m//i)%m
        finv[i]=finv[i-1]*inv[i]%m
    return fac[n]*(finv[k]*finv[n-k]%m)%m modcomb M=M%INF M%INF M ans=ans+Ms ans+Ms ans M=-(m-1)*m*(2*m-1)//3+m*m*(m-1) -(m-1)*m*(2*m-1)//3+m*m*(m-1) M m,k=map(int,input().split()) map(int,input().split()) m n,m,k=map(int,input().split()) map(int,input().split()) n M=-(m-1)*m*(2*m-1)//3+m*m*(m-1) -(m-1)*m*(2*m-1)//3+m*m*(m-1) M ans=ans%INF ans%INF ans Ms=m*m*(m-1)//2-(m-1)*m*(2*m-1)//6 m*m*(m-1)//2-(m-1)*m*(2*m-1)//6 Ms d=j-i j-i d d=j-i j-i d ans=ans+d*m**2+M ans+d*m**2+M ans INF=10**9+7 10**9+7 INF ans=ans+Ms ans+Ms ans ans=0 0 ans Ms=Ms%INF Ms%INF Ms k=map(int,input().split()) map(int,input().split()) k M=M%INF M%INF M ans=ans%INF ans%INF ans ans=ans+d*m**2+M ans+d*m**2+M ans Ms=Ms%INF Ms%INF Ms Ms=m*m*(m-1)//2-(m-1)*m*(2*m-1)//6 m*m*(m-1)//2-(m-1)*m*(2*m-1)//6 Ms ans=ans*modcomb(n*m-2,k-2,INF)%INF ans*modcomb(n*m-2,k-2,INF)%INF ans
n,m,k=map(int,input().split())
ans=0
INF=10**9+7
if n<=m:
    M=-(m-1)*m*(2*m-1)//3+m*m*(m-1)
    Ms=m*m*(m-1)//2-(m-1)*m*(2*m-1)//6
    M=M%INF
    Ms=Ms%INF
    for i in range(1,n+1):
        for j in range(i,n+1):
            if i==j:
                ans=ans+Ms
            else:
                d=j-i
                ans=ans+d*m**2+M
            ans=ans%INF
else:
    (n,m)=(m,n)
    M=-(m-1)*m*(2*m-1)//3+m*m*(m-1)
    Ms=m*m*(m-1)//2-(m-1)*m*(2*m-1)//6
    M=M%INF
    Ms=Ms%INF
    for i in range(1,n+1):
        for j in range(i,n+1):
            if i==j:
                ans=ans+Ms
            else:
                d=j-i
                ans=ans+d*m**2+M
            ans=ans%INF
def modcomb(n,k,m):
    fac=[0]*(n+1)
    finv=[0]*(n+1)
    inv=[0]*(n+1)
    fac[0]=fac[1]=1
    finv[0]=finv[1]=1
    inv[1]=1
    for i in range(2,n+1):
        fac[i]=fac[i-1]*i%m
        inv[i]=m-inv[m%i]*(m//i)%m
        finv[i]=finv[i-1]*inv[i]%m
    return fac[n]*(finv[k]*finv[n-k]%m)%m
ans=ans*modcomb(n*m-2,k-2,INF)%INF
print(ans)

