n,m,k=map(int,input().split())
mod = 10**9+7
fac = [1]
caf = [1]
def pow(n,p):
    res=1
    while p >0:
        if p%2==0:
            n = n**2 % mod
            p //= 2
        else:
            res = res * n % mod
            p -= 1
    return res % mod

for i in range(1,n*m):
    fac.append((fac[i-1]*i)%mod)
    caf.append(pow(fac[i],mod-2))

def ncr(n,r):
    if n < r or r < 0: return 0
    return fac[n]*caf[r]*caf[n-r]

div2 = caf[2]

sums = [0]
for i in range((max(n,m))):
    sums.append((sums[-1]+i+1) % mod)

res1 = 0
for i in range(m):
    res1 += sums[i]+sums[m-1-i]
    res1 %= mod
res1 *= (n*n)%mod
res1 %= mod

res2 = 0
for i in range(n):
    res2 += sums[i]+sums[n-1-i]
    res2 %= mod
res2 *= (m*m)%mod
res2 %= mod

res = ((res1+res2)*div2)%mod
kc2 = ncr(n*m-2,k-2)
print((res*kc2)%mod) 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 fac = [1] fac [1] 1 caf = [1] caf [1] 1 def pow(n,p):
    res=1
    while p >0:
        if p%2==0:
            n = n**2 % mod
            p //= 2
        else:
            res = res * n % mod
            p -= 1
    return res % mod pow res=1 res 1 while p >0:
        if p%2==0:
            n = n**2 % mod
            p //= 2
        else:
            res = res * n % mod
            p -= 1
     p >0 p 0 if p%2==0:
            n = n**2 % mod
            p //= 2
        else:
            res = res * n % mod
            p -= 1
     p%2==0 p%2 p 2 0 n = n**2 % mod n n**2 % mod n**2 n 2 mod p //= 2 p 2 res = res * n % mod res res * n % mod res * n res n mod p -= 1 p 1 return res % mod res % mod res mod n n p p for i in range(1,n*m):
    fac.append((fac[i-1]*i)%mod)
    caf.append(pow(fac[i],mod-2)) i range(1,n*m) range 1 n*m n m fac.append((fac[i-1]*i)%mod) fac.append fac append (fac[i-1]*i)%mod fac[i-1]*i fac[i-1] fac i-1 i 1 i mod caf.append(pow(fac[i],mod-2)) caf.append caf append pow(fac[i],mod-2) pow fac[i] fac i mod-2 mod 2 def ncr(n,r):
    if n < r or r < 0: return 0
    return fac[n]*caf[r]*caf[n-r] ncr if n < r or r < 0: return 0
     n < r or r < 0 n < r n r r < 0 r 0 return fac[n]*caf[r]*caf[n-r] fac[n]*caf[r]*caf[n-r] fac[n]*caf[r] fac[n] fac n caf[r] caf r caf[n-r] caf n-r n r n n r r div2 = caf[2] div2 caf[2] caf 2 sums = [0] sums [0] 0 for i in range((max(n,m))):
    sums.append((sums[-1]+i+1) % mod) i range((max(n,m))) range max(n,m) max n m sums.append((sums[-1]+i+1) % mod) sums.append sums append (sums[-1]+i+1) % mod sums[-1]+i+1 sums[-1]+i sums[-1] sums -1 i 1 mod res1 = 0 res1 0 for i in range(m):
    res1 += sums[i]+sums[m-1-i]
    res1 %= mod i range(m) range m res1 += sums[i]+sums[m-1-i] res1 sums[i]+sums[m-1-i] sums[i] sums i sums[m-1-i] sums m-1-i m-1 m 1 i res1 %= mod res1 mod res1 *= (n*n)%mod res1 (n*n)%mod n*n n n mod res1 %= mod res1 mod res2 = 0 res2 0 for i in range(n):
    res2 += sums[i]+sums[n-1-i]
    res2 %= mod i range(n) range n res2 += sums[i]+sums[n-1-i] res2 sums[i]+sums[n-1-i] sums[i] sums i sums[n-1-i] sums n-1-i n-1 n 1 i res2 %= mod res2 mod res2 *= (m*m)%mod res2 (m*m)%mod m*m m m mod res2 %= mod res2 mod res = ((res1+res2)*div2)%mod res ((res1+res2)*div2)%mod (res1+res2)*div2 res1+res2 res1 res2 div2 mod kc2 = ncr(n*m-2,k-2) kc2 ncr(n*m-2,k-2) ncr n*m-2 n*m n m 2 k-2 k 2 print((res*kc2)%mod) print (res*kc2)%mod res*kc2 res kc2 mod res = ((res1+res2)*div2)%mod ((res1+res2)*div2)%mod res res2 %= mod mod res2 res2 %= mod mod res2 mod = 10**9+7 10**9+7 mod res1 += sums[i]+sums[m-1-i] sums[i]+sums[m-1-i] res1 fac = [1] [1] fac res1 %= mod mod res1 m,k=map(int,input().split()) map(int,input().split()) m res1 %= mod mod res1 res1 = 0 0 res1 def ncr(n,r):
    if n < r or r < 0: return 0
    return fac[n]*caf[r]*caf[n-r] def ncr(n,r):
    if n < r or r < 0: return 0
    return fac[n]*caf[r]*caf[n-r] ncr k=map(int,input().split()) map(int,input().split()) k sums = [0] [0] sums res2 = 0 0 res2 n,m,k=map(int,input().split()) map(int,input().split()) n kc2 = ncr(n*m-2,k-2) ncr(n*m-2,k-2) kc2 res1 *= (n*n)%mod (n*n)%mod res1 res2 *= (m*m)%mod (m*m)%mod res2 caf = [1] [1] caf def pow(n,p):
    res=1
    while p >0:
        if p%2==0:
            n = n**2 % mod
            p //= 2
        else:
            res = res * n % mod
            p -= 1
    return res % mod def pow(n,p):
    res=1
    while p >0:
        if p%2==0:
            n = n**2 % mod
            p //= 2
        else:
            res = res * n % mod
            p -= 1
    return res % mod pow res2 += sums[i]+sums[n-1-i] sums[i]+sums[n-1-i] res2 div2 = caf[2] caf[2] div2
n,m,k=map(int,input().split())
mod = 10**9+7
fac = [1]
caf = [1]
def pow(n,p):
    res=1
    while p >0:
        if p%2==0:
            n = n**2 % mod
            p //= 2
        else:
            res = res * n % mod
            p -= 1
    return res % mod

for i in range(1,n*m):
    fac.append((fac[i-1]*i)%mod)
    caf.append(pow(fac[i],mod-2))

def ncr(n,r):
    if n < r or r < 0: return 0
    return fac[n]*caf[r]*caf[n-r]

div2 = caf[2]

sums = [0]
for i in range((max(n,m))):
    sums.append((sums[-1]+i+1) % mod)

res1 = 0
for i in range(m):
    res1 += sums[i]+sums[m-1-i]
    res1 %= mod
res1 *= (n*n)%mod
res1 %= mod

res2 = 0
for i in range(n):
    res2 += sums[i]+sums[n-1-i]
    res2 %= mod
res2 *= (m*m)%mod
res2 %= mod

res = ((res1+res2)*div2)%mod
kc2 = ncr(n*m-2,k-2)
print((res*kc2)%mod)