n,m,k = map(int,input().split())
mod = 10**9+7
def combination(n,r,p):
    if n < r or r < 0:
        return 0
    r = min(n-r,r)
    
    fact = [1,1]
    factinv = [1,1]
    inv = [0,1]
    for i in range(2,n+1):
        fact.append((fact[-1]*i)%p)
        inv.append((-inv[p%i]*(p//i))%p)
        factinv.append((factinv[-1]*inv[-1])%p)
    return fact[n]*factinv[r]*factinv[n-r]%p
temp = combination(n*m-2,k-2,mod)
ans = 0
for d in range(1,n):
    ans += d*((n-d)*(m**2))*temp
for d in range(1,m):
    ans += d*((m-d)*(n**2))*temp
print(ans%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 def combination(n,r,p):
    if n < r or r < 0:
        return 0
    r = min(n-r,r)
    
    fact = [1,1]
    factinv = [1,1]
    inv = [0,1]
    for i in range(2,n+1):
        fact.append((fact[-1]*i)%p)
        inv.append((-inv[p%i]*(p//i))%p)
        factinv.append((factinv[-1]*inv[-1])%p)
    return fact[n]*factinv[r]*factinv[n-r]%p combination if n < r or r < 0:
        return 0
     n < r or r < 0 n < r n r r < 0 r 0 return 0 0 r = min(n-r,r) r min(n-r,r) min n-r n r r fact = [1,1] fact [1,1] 1 1 factinv = [1,1] factinv [1,1] 1 1 inv = [0,1] inv [0,1] 0 1 for i in range(2,n+1):
        fact.append((fact[-1]*i)%p)
        inv.append((-inv[p%i]*(p//i))%p)
        factinv.append((factinv[-1]*inv[-1])%p)
     i range(2,n+1) range 2 n+1 n 1 fact.append((fact[-1]*i)%p) fact.append fact append (fact[-1]*i)%p fact[-1]*i fact[-1] fact -1 i p inv.append((-inv[p%i]*(p//i))%p) inv.append inv append (-inv[p%i]*(p//i))%p -inv[p%i]*(p//i) -inv[p%i] inv[p%i] inv p%i p i p//i p i p factinv.append((factinv[-1]*inv[-1])%p) factinv.append factinv append (factinv[-1]*inv[-1])%p factinv[-1]*inv[-1] factinv[-1] factinv -1 inv[-1] inv -1 p return fact[n]*factinv[r]*factinv[n-r]%p fact[n]*factinv[r]*factinv[n-r]%p fact[n]*factinv[r]*factinv[n-r] fact[n]*factinv[r] fact[n] fact n factinv[r] factinv r factinv[n-r] factinv n-r n r p n n r r p p temp = combination(n*m-2,k-2,mod) temp combination(n*m-2,k-2,mod) combination n*m-2 n*m n m 2 k-2 k 2 mod ans = 0 ans 0 for d in range(1,n):
    ans += d*((n-d)*(m**2))*temp d range(1,n) range 1 n ans += d*((n-d)*(m**2))*temp ans d*((n-d)*(m**2))*temp d*((n-d)*(m**2)) d (n-d)*(m**2) n-d n d m**2 m 2 temp for d in range(1,m):
    ans += d*((m-d)*(n**2))*temp d range(1,m) range 1 m ans += d*((m-d)*(n**2))*temp ans d*((m-d)*(n**2))*temp d*((m-d)*(n**2)) d (m-d)*(n**2) m-d m d n**2 n 2 temp print(ans%mod) print ans%mod ans mod k = map(int,input().split()) map(int,input().split()) k def combination(n,r,p):
    if n < r or r < 0:
        return 0
    r = min(n-r,r)
    
    fact = [1,1]
    factinv = [1,1]
    inv = [0,1]
    for i in range(2,n+1):
        fact.append((fact[-1]*i)%p)
        inv.append((-inv[p%i]*(p//i))%p)
        factinv.append((factinv[-1]*inv[-1])%p)
    return fact[n]*factinv[r]*factinv[n-r]%p def combination(n,r,p):
    if n < r or r < 0:
        return 0
    r = min(n-r,r)
    
    fact = [1,1]
    factinv = [1,1]
    inv = [0,1]
    for i in range(2,n+1):
        fact.append((fact[-1]*i)%p)
        inv.append((-inv[p%i]*(p//i))%p)
        factinv.append((factinv[-1]*inv[-1])%p)
    return fact[n]*factinv[r]*factinv[n-r]%p combination temp = combination(n*m-2,k-2,mod) combination(n*m-2,k-2,mod) temp ans += d*((n-d)*(m**2))*temp d*((n-d)*(m**2))*temp ans n,m,k = map(int,input().split()) map(int,input().split()) n mod = 10**9+7 10**9+7 mod ans = 0 0 ans ans += d*((m-d)*(n**2))*temp d*((m-d)*(n**2))*temp ans m,k = map(int,input().split()) map(int,input().split()) m
n,m,k = map(int,input().split())
mod = 10**9+7
def combination(n,r,p):
    if n < r or r < 0:
        return 0
    r = min(n-r,r)
    
    fact = [1,1]
    factinv = [1,1]
    inv = [0,1]
    for i in range(2,n+1):
        fact.append((fact[-1]*i)%p)
        inv.append((-inv[p%i]*(p//i))%p)
        factinv.append((factinv[-1]*inv[-1])%p)
    return fact[n]*factinv[r]*factinv[n-r]%p
temp = combination(n*m-2,k-2,mod)
ans = 0
for d in range(1,n):
    ans += d*((n-d)*(m**2))*temp
for d in range(1,m):
    ans += d*((m-d)*(n**2))*temp
print(ans%mod)