N,M,K=map(int,input().split())
def cmb(n, r, mod):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod
mod=10**9+7
g1=[1,1]
g2=[1,1]
inverse=[0,1]
for i in range(2,N*M+1):
    g1.append((g1[-1]*i)%mod)
    inverse.append((-inverse[mod%i]*(mod//i))%mod)
    g2.append((g2[-1]*inverse[-1])%mod)
ans=0
for i in range(1,N):
  ans+=i*(N-i)*M*M
for j in range(1,M):
  ans+=j*(M-j)*N*N
ans*=cmb(N*M-2,K-2,mod)
print(ans%mod) 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, mod):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod cmb if ( r<0 or r>n ):
        return 0
     r<0 or r>n r<0 r 0 r>n r n return 0 0 r = min(r, n-r) r min(r, n-r) min r n-r n r return g1[n] * g2[r] * g2[n-r] % mod g1[n] * g2[r] * g2[n-r] % mod g1[n] * g2[r] * g2[n-r] g1[n] * g2[r] g1[n] g1 n g2[r] g2 r g2[n-r] g2 n-r n r mod n n r r mod mod mod=10**9+7 mod 10**9+7 10**9 10 9 7 g1=[1,1] g1 [1,1] 1 1 g2=[1,1] g2 [1,1] 1 1 inverse=[0,1] inverse [0,1] 0 1 for i in range(2,N*M+1):
    g1.append((g1[-1]*i)%mod)
    inverse.append((-inverse[mod%i]*(mod//i))%mod)
    g2.append((g2[-1]*inverse[-1])%mod) i range(2,N*M+1) range 2 N*M+1 N*M N M 1 g1.append((g1[-1]*i)%mod) g1.append g1 append (g1[-1]*i)%mod g1[-1]*i g1[-1] g1 -1 i mod inverse.append((-inverse[mod%i]*(mod//i))%mod) inverse.append inverse append (-inverse[mod%i]*(mod//i))%mod -inverse[mod%i]*(mod//i) -inverse[mod%i] inverse[mod%i] inverse mod%i mod i mod//i mod i mod g2.append((g2[-1]*inverse[-1])%mod) g2.append g2 append (g2[-1]*inverse[-1])%mod g2[-1]*inverse[-1] g2[-1] g2 -1 inverse[-1] inverse -1 mod ans=0 ans 0 for i in range(1,N):
  ans+=i*(N-i)*M*M i range(1,N) range 1 N ans+=i*(N-i)*M*M ans i*(N-i)*M*M i*(N-i)*M i*(N-i) i N-i N i M M for j in range(1,M):
  ans+=j*(M-j)*N*N j range(1,M) range 1 M ans+=j*(M-j)*N*N ans j*(M-j)*N*N j*(M-j)*N j*(M-j) j M-j M j N N ans*=cmb(N*M-2,K-2,mod) ans cmb(N*M-2,K-2,mod) cmb N*M-2 N*M N M 2 K-2 K 2 mod print(ans%mod) print ans%mod ans mod g1=[1,1] [1,1] g1 def cmb(n, r, mod):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod def cmb(n, r, mod):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod cmb M,K=map(int,input().split()) map(int,input().split()) M K=map(int,input().split()) map(int,input().split()) K g2=[1,1] [1,1] g2 N,M,K=map(int,input().split()) map(int,input().split()) N inverse=[0,1] [0,1] inverse mod=10**9+7 10**9+7 mod ans+=j*(M-j)*N*N j*(M-j)*N*N ans ans+=i*(N-i)*M*M i*(N-i)*M*M ans ans*=cmb(N*M-2,K-2,mod) cmb(N*M-2,K-2,mod) ans ans=0 0 ans
N,M,K=map(int,input().split())
def cmb(n, r, mod):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod
mod=10**9+7
g1=[1,1]
g2=[1,1]
inverse=[0,1]
for i in range(2,N*M+1):
    g1.append((g1[-1]*i)%mod)
    inverse.append((-inverse[mod%i]*(mod//i))%mod)
    g2.append((g2[-1]*inverse[-1])%mod)
ans=0
for i in range(1,N):
  ans+=i*(N-i)*M*M
for j in range(1,M):
  ans+=j*(M-j)*N*N
ans*=cmb(N*M-2,K-2,mod)
print(ans%mod)