n,m,k = map(int,input().split())
mod = 10**9+7
rng = n*m+10
fctr = [1]
finv = [1]
for i in range(1,rng):
  fctr.append(fctr[-1]*i%mod)
for i in range(1,rng):
  finv.append(pow(fctr[i],mod-2,mod))
def cmb(n,k):
  if n<0 or k<0:
    return 0
  else:
    return fctr[n]*finv[n-k]*finv[k]%mod

cost = [[0 for i in range(m+1)] for j in range(n+1)]
cost[1][1] = ((n-1)+(m-1))*n*m//2
for i in range(1,n+1):
  for j in range(1,m+1):
    if j>1:
      cost[i][j] = cost[i][j-1]-(m-2*(j-1))*n
    elif i>1:
      cost[i][j] = cost[i-1][j]-(n-2*(i-1))*m
ans = 0
for i in cost:
  ans = (ans+sum(i))%mod
ans = ans*pow(2,mod-2,mod)%mod
ans = ans*cmb(n*m-2,k-2)%mod
print(ans) n,m,k = map(int,input().split()) n map(int,input().split()) map int input().split() ().split () input split m k mod = 10**9+7 mod 10**9+7 10**9 10 9 7 rng = n*m+10 rng n*m+10 n*m n m 10 fctr = [1] fctr [1] 1 finv = [1] finv [1] 1 for i in range(1,rng):
  fctr.append(fctr[-1]*i%mod) i range(1,rng) range 1 rng fctr.append(fctr[-1]*i%mod) fctr.append fctr append fctr[-1]*i%mod fctr[-1]*i fctr[-1] fctr -1 i mod for i in range(1,rng):
  finv.append(pow(fctr[i],mod-2,mod)) i range(1,rng) range 1 rng finv.append(pow(fctr[i],mod-2,mod)) finv.append finv append pow(fctr[i],mod-2,mod) pow fctr[i] fctr i mod-2 mod 2 mod def cmb(n,k):
  if n<0 or k<0:
    return 0
  else:
    return fctr[n]*finv[n-k]*finv[k]%mod cmb if n<0 or k<0:
    return 0
  else:
    return fctr[n]*finv[n-k]*finv[k]%mod n<0 or k<0 n<0 n 0 k<0 k 0 return 0 0 return fctr[n]*finv[n-k]*finv[k]%mod fctr[n]*finv[n-k]*finv[k]%mod fctr[n]*finv[n-k]*finv[k] fctr[n]*finv[n-k] fctr[n] fctr n finv[n-k] finv n-k n k finv[k] finv k mod n n k k [0 for i in range(m+1)] for j in range(n+1) for j in range(n+1) j range(n+1) range n+1 n 1 for j in range(n+1) [0 for i in range(m+1)] cost = [[0 for i in range(m+1)] for j in range(n+1)] cost [[0 for i in range(m+1)] for j in range(n+1)] cost[1][1] = ((n-1)+(m-1))*n*m//2 cost[1][1] [1] cost 1 1 ((n-1)+(m-1))*n*m//2 ((n-1)+(m-1))*n*m ((n-1)+(m-1))*n (n-1)+(m-1) n-1 n 1 m-1 m 1 n m 2 for i in range(1,n+1):
  for j in range(1,m+1):
    if j>1:
      cost[i][j] = cost[i][j-1]-(m-2*(j-1))*n
    elif i>1:
      cost[i][j] = cost[i-1][j]-(n-2*(i-1))*m i range(1,n+1) range 1 n+1 n 1 for j in range(1,m+1):
    if j>1:
      cost[i][j] = cost[i][j-1]-(m-2*(j-1))*n
    elif i>1:
      cost[i][j] = cost[i-1][j]-(n-2*(i-1))*m j range(1,m+1) range 1 m+1 m 1 if j>1:
      cost[i][j] = cost[i][j-1]-(m-2*(j-1))*n
    elif i>1:
      cost[i][j] = cost[i-1][j]-(n-2*(i-1))*m j>1 j 1 cost[i][j] = cost[i][j-1]-(m-2*(j-1))*n cost[i][j] [i] cost i j cost[i][j-1]-(m-2*(j-1))*n cost[i][j-1] [i] cost i j-1 j 1 (m-2*(j-1))*n m-2*(j-1) m 2*(j-1) 2 j-1 j 1 n elif i>1:
      cost[i][j] = cost[i-1][j]-(n-2*(i-1))*m i>1 i 1 cost[i][j] = cost[i-1][j]-(n-2*(i-1))*m cost[i][j] [i] cost i j cost[i-1][j]-(n-2*(i-1))*m cost[i-1][j] [i-1] cost i-1 i 1 j (n-2*(i-1))*m n-2*(i-1) n 2*(i-1) 2 i-1 i 1 m ans = 0 ans 0 for i in cost:
  ans = (ans+sum(i))%mod i cost ans = (ans+sum(i))%mod ans (ans+sum(i))%mod ans+sum(i) ans sum(i) sum i mod ans = ans*pow(2,mod-2,mod)%mod ans ans*pow(2,mod-2,mod)%mod ans*pow(2,mod-2,mod) ans pow(2,mod-2,mod) pow 2 mod-2 mod 2 mod mod ans = ans*cmb(n*m-2,k-2)%mod ans ans*cmb(n*m-2,k-2)%mod ans*cmb(n*m-2,k-2) ans cmb(n*m-2,k-2) cmb n*m-2 n*m n m 2 k-2 k 2 mod print(ans) print ans mod = 10**9+7 10**9+7 mod ans = 0 0 ans rng = n*m+10 n*m+10 rng ans = ans*cmb(n*m-2,k-2)%mod ans*cmb(n*m-2,k-2)%mod ans fctr = [1] [1] fctr cost = [[0 for i in range(m+1)] for j in range(n+1)] [[0 for i in range(m+1)] for j in range(n+1)] cost k = map(int,input().split()) map(int,input().split()) k n,m,k = map(int,input().split()) map(int,input().split()) n finv = [1] [1] finv def cmb(n,k):
  if n<0 or k<0:
    return 0
  else:
    return fctr[n]*finv[n-k]*finv[k]%mod def cmb(n,k):
  if n<0 or k<0:
    return 0
  else:
    return fctr[n]*finv[n-k]*finv[k]%mod cmb m,k = map(int,input().split()) map(int,input().split()) m ans = ans*pow(2,mod-2,mod)%mod ans*pow(2,mod-2,mod)%mod ans ans = (ans+sum(i))%mod (ans+sum(i))%mod ans
n,m,k = map(int,input().split())
mod = 10**9+7
rng = n*m+10
fctr = [1]
finv = [1]
for i in range(1,rng):
  fctr.append(fctr[-1]*i%mod)
for i in range(1,rng):
  finv.append(pow(fctr[i],mod-2,mod))
def cmb(n,k):
  if n<0 or k<0:
    return 0
  else:
    return fctr[n]*finv[n-k]*finv[k]%mod

cost = [[0 for i in range(m+1)] for j in range(n+1)]
cost[1][1] = ((n-1)+(m-1))*n*m//2
for i in range(1,n+1):
  for j in range(1,m+1):
    if j>1:
      cost[i][j] = cost[i][j-1]-(m-2*(j-1))*n
    elif i>1:
      cost[i][j] = cost[i-1][j]-(n-2*(i-1))*m
ans = 0
for i in cost:
  ans = (ans+sum(i))%mod
ans = ans*pow(2,mod-2,mod)%mod
ans = ans*cmb(n*m-2,k-2)%mod
print(ans)