def pmod(a,b,m):
  ret=1
  while b>0:
    if b&1:
      ret=(ret*a)%m
    a=(a*a)%m
    b=b>>1
  return ret
  
def fmod(n,m):
  ret=1
  for i in range(n,0,-1):
    ret=(ret*i)%m
  return ret

def cmod(n,r,m):
  ret=1
  for i in range(r):
    ret=(ret*(n-i))%m
  return (ret*pmod(fmod(r,m),m-2,m))%m

mod=10**9+7
n,m,k=map(int,input().split())
ans=0
c=cmod(n*m-2,k-2,mod)
for i in range(1,n):
  ans+=i*c*(m**2)*(n-i)
  ans=ans%mod
for i in range(1,m):
  ans+=i*c*(n**2)*(m-i)
  ans=ans%mod
print(ans%mod) def pmod(a,b,m):
  ret=1
  while b>0:
    if b&1:
      ret=(ret*a)%m
    a=(a*a)%m
    b=b>>1
  return ret
   pmod ret=1 ret 1 while b>0:
    if b&1:
      ret=(ret*a)%m
    a=(a*a)%m
    b=b>>1
   b>0 b 0 if b&1:
      ret=(ret*a)%m
     b&1 b 1 ret=(ret*a)%m ret (ret*a)%m ret*a ret a m a=(a*a)%m a (a*a)%m a*a a a m b=b>>1 b b>>1 b 1 return ret ret a a b b m m def fmod(n,m):
  ret=1
  for i in range(n,0,-1):
    ret=(ret*i)%m
  return ret fmod ret=1 ret 1 for i in range(n,0,-1):
    ret=(ret*i)%m
   i range(n,0,-1) range n 0 -1 ret=(ret*i)%m ret (ret*i)%m ret*i ret i m return ret ret n n m m def cmod(n,r,m):
  ret=1
  for i in range(r):
    ret=(ret*(n-i))%m
  return (ret*pmod(fmod(r,m),m-2,m))%m cmod ret=1 ret 1 for i in range(r):
    ret=(ret*(n-i))%m
   i range(r) range r ret=(ret*(n-i))%m ret (ret*(n-i))%m ret*(n-i) ret n-i n i m return (ret*pmod(fmod(r,m),m-2,m))%m (ret*pmod(fmod(r,m),m-2,m))%m ret*pmod(fmod(r,m),m-2,m) ret pmod(fmod(r,m),m-2,m) pmod fmod(r,m) fmod r m m-2 m 2 m m n n r r m m 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 ans=0 ans 0 c=cmod(n*m-2,k-2,mod) c cmod(n*m-2,k-2,mod) cmod n*m-2 n*m n m 2 k-2 k 2 mod for i in range(1,n):
  ans+=i*c*(m**2)*(n-i)
  ans=ans%mod i range(1,n) range 1 n ans+=i*c*(m**2)*(n-i) ans i*c*(m**2)*(n-i) i*c*(m**2) i*c i c m**2 m 2 n-i n i ans=ans%mod ans ans%mod ans mod for i in range(1,m):
  ans+=i*c*(n**2)*(m-i)
  ans=ans%mod i range(1,m) range 1 m ans+=i*c*(n**2)*(m-i) ans i*c*(n**2)*(m-i) i*c*(n**2) i*c i c n**2 n 2 m-i m i ans=ans%mod ans ans%mod ans mod print(ans%mod) print ans%mod ans mod ans=0 0 ans ans=ans%mod ans%mod ans def pmod(a,b,m):
  ret=1
  while b>0:
    if b&1:
      ret=(ret*a)%m
    a=(a*a)%m
    b=b>>1
  return ret
   def pmod(a,b,m):
  ret=1
  while b>0:
    if b&1:
      ret=(ret*a)%m
    a=(a*a)%m
    b=b>>1
  return ret
   pmod def cmod(n,r,m):
  ret=1
  for i in range(r):
    ret=(ret*(n-i))%m
  return (ret*pmod(fmod(r,m),m-2,m))%m def cmod(n,r,m):
  ret=1
  for i in range(r):
    ret=(ret*(n-i))%m
  return (ret*pmod(fmod(r,m),m-2,m))%m cmod ans+=i*c*(n**2)*(m-i) i*c*(n**2)*(m-i) ans m,k=map(int,input().split()) map(int,input().split()) m k=map(int,input().split()) map(int,input().split()) k c=cmod(n*m-2,k-2,mod) cmod(n*m-2,k-2,mod) c ans=ans%mod ans%mod ans def fmod(n,m):
  ret=1
  for i in range(n,0,-1):
    ret=(ret*i)%m
  return ret def fmod(n,m):
  ret=1
  for i in range(n,0,-1):
    ret=(ret*i)%m
  return ret fmod mod=10**9+7 10**9+7 mod n,m,k=map(int,input().split()) map(int,input().split()) n ans+=i*c*(m**2)*(n-i) i*c*(m**2)*(n-i) ans
def pmod(a,b,m):
  ret=1
  while b>0:
    if b&1:
      ret=(ret*a)%m
    a=(a*a)%m
    b=b>>1
  return ret
  
def fmod(n,m):
  ret=1
  for i in range(n,0,-1):
    ret=(ret*i)%m
  return ret

def cmod(n,r,m):
  ret=1
  for i in range(r):
    ret=(ret*(n-i))%m
  return (ret*pmod(fmod(r,m),m-2,m))%m

mod=10**9+7
n,m,k=map(int,input().split())
ans=0
c=cmod(n*m-2,k-2,mod)
for i in range(1,n):
  ans+=i*c*(m**2)*(n-i)
  ans=ans%mod
for i in range(1,m):
  ans+=i*c*(n**2)*(m-i)
  ans=ans%mod
print(ans%mod)