MOD=10**9+7
N,M,K=map(int,input().split())

def powmod(a,p):
  if p==0:
    return 1
  elif p==1:
    return a
  else:
    pow2=powmod(a,p//2)
    if p%2==0:
      return (pow2**2)%MOD
    else:
      return (a*pow2**2)%MOD

def invmod(a):
  return powmod(a,MOD-2)

def comb_mod(n,r):
  nPr=1
  fact_r=1
  for i in range(r):
    nPr*=n-i
    nPr%=MOD
    fact_r*=r-i
    fact_r%=MOD  
  return (nPr*invmod(fact_r))%MOD

answer_tate=0
for d in range(1,N):
  answer_tate+=d*M**2*(N-d)
  answer_tate%=MOD
  
answer_yoko=0
for d in range(1,M):
  answer_yoko+=d*N**2*(M-d)
  answer_yoko%=MOD

comb=comb_mod(N*M-2,K-2)
print(comb*(answer_tate+answer_yoko)%MOD) 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 def powmod(a,p):
  if p==0:
    return 1
  elif p==1:
    return a
  else:
    pow2=powmod(a,p//2)
    if p%2==0:
      return (pow2**2)%MOD
    else:
      return (a*pow2**2)%MOD powmod if p==0:
    return 1
  elif p==1:
    return a
  else:
    pow2=powmod(a,p//2)
    if p%2==0:
      return (pow2**2)%MOD
    else:
      return (a*pow2**2)%MOD p==0 p 0 return 1 1 elif p==1:
    return a
   p==1 p 1 return a a pow2=powmod(a,p//2) pow2 powmod(a,p//2) powmod a p//2 p 2 if p%2==0:
      return (pow2**2)%MOD
    else:
      return (a*pow2**2)%MOD p%2==0 p%2 p 2 0 return (pow2**2)%MOD (pow2**2)%MOD pow2**2 pow2 2 MOD return (a*pow2**2)%MOD (a*pow2**2)%MOD a*pow2**2 a pow2**2 pow2 2 MOD a a p p def invmod(a):
  return powmod(a,MOD-2) invmod return powmod(a,MOD-2) powmod(a,MOD-2) powmod a MOD-2 MOD 2 a a def comb_mod(n,r):
  nPr=1
  fact_r=1
  for i in range(r):
    nPr*=n-i
    nPr%=MOD
    fact_r*=r-i
    fact_r%=MOD  
  return (nPr*invmod(fact_r))%MOD comb_mod nPr=1 nPr 1 fact_r=1 fact_r 1 for i in range(r):
    nPr*=n-i
    nPr%=MOD
    fact_r*=r-i
    fact_r%=MOD  
   i range(r) range r nPr*=n-i nPr n-i n i nPr%=MOD nPr MOD fact_r*=r-i fact_r r-i r i fact_r%=MOD fact_r MOD return (nPr*invmod(fact_r))%MOD (nPr*invmod(fact_r))%MOD nPr*invmod(fact_r) nPr invmod(fact_r) invmod fact_r MOD n n r r answer_tate=0 answer_tate 0 for d in range(1,N):
  answer_tate+=d*M**2*(N-d)
  answer_tate%=MOD
   d range(1,N) range 1 N answer_tate+=d*M**2*(N-d) answer_tate d*M**2*(N-d) d*M**2 d M**2 M 2 N-d N d answer_tate%=MOD answer_tate MOD answer_yoko=0 answer_yoko 0 for d in range(1,M):
  answer_yoko+=d*N**2*(M-d)
  answer_yoko%=MOD d range(1,M) range 1 M answer_yoko+=d*N**2*(M-d) answer_yoko d*N**2*(M-d) d*N**2 d N**2 N 2 M-d M d answer_yoko%=MOD answer_yoko MOD comb=comb_mod(N*M-2,K-2) comb comb_mod(N*M-2,K-2) comb_mod N*M-2 N*M N M 2 K-2 K 2 print(comb*(answer_tate+answer_yoko)%MOD) print comb*(answer_tate+answer_yoko)%MOD comb*(answer_tate+answer_yoko) comb answer_tate+answer_yoko answer_tate answer_yoko MOD def comb_mod(n,r):
  nPr=1
  fact_r=1
  for i in range(r):
    nPr*=n-i
    nPr%=MOD
    fact_r*=r-i
    fact_r%=MOD  
  return (nPr*invmod(fact_r))%MOD def comb_mod(n,r):
  nPr=1
  fact_r=1
  for i in range(r):
    nPr*=n-i
    nPr%=MOD
    fact_r*=r-i
    fact_r%=MOD  
  return (nPr*invmod(fact_r))%MOD comb_mod def powmod(a,p):
  if p==0:
    return 1
  elif p==1:
    return a
  else:
    pow2=powmod(a,p//2)
    if p%2==0:
      return (pow2**2)%MOD
    else:
      return (a*pow2**2)%MOD def powmod(a,p):
  if p==0:
    return 1
  elif p==1:
    return a
  else:
    pow2=powmod(a,p//2)
    if p%2==0:
      return (pow2**2)%MOD
    else:
      return (a*pow2**2)%MOD powmod MOD=10**9+7 10**9+7 MOD answer_yoko=0 0 answer_yoko answer_tate+=d*M**2*(N-d) d*M**2*(N-d) answer_tate answer_yoko%=MOD MOD answer_yoko K=map(int,input().split()) map(int,input().split()) K answer_tate=0 0 answer_tate M,K=map(int,input().split()) map(int,input().split()) M def invmod(a):
  return powmod(a,MOD-2) def invmod(a):
  return powmod(a,MOD-2) invmod answer_yoko+=d*N**2*(M-d) d*N**2*(M-d) answer_yoko answer_tate%=MOD MOD answer_tate N,M,K=map(int,input().split()) map(int,input().split()) N comb=comb_mod(N*M-2,K-2) comb_mod(N*M-2,K-2) comb
MOD=10**9+7
N,M,K=map(int,input().split())

def powmod(a,p):
  if p==0:
    return 1
  elif p==1:
    return a
  else:
    pow2=powmod(a,p//2)
    if p%2==0:
      return (pow2**2)%MOD
    else:
      return (a*pow2**2)%MOD

def invmod(a):
  return powmod(a,MOD-2)

def comb_mod(n,r):
  nPr=1
  fact_r=1
  for i in range(r):
    nPr*=n-i
    nPr%=MOD
    fact_r*=r-i
    fact_r%=MOD  
  return (nPr*invmod(fact_r))%MOD

answer_tate=0
for d in range(1,N):
  answer_tate+=d*M**2*(N-d)
  answer_tate%=MOD
  
answer_yoko=0
for d in range(1,M):
  answer_yoko+=d*N**2*(M-d)
  answer_yoko%=MOD

comb=comb_mod(N*M-2,K-2)
print(comb*(answer_tate+answer_yoko)%MOD)