#cmb
mod=10**9+7
MAX=2*10**5+100

g1=[1,1]
g2=[1,1]
for i in range(2,MAX+1):
    num_1=g1[-1]*i%mod
    g1.append(num_1)
    g2.append(pow(num_1,mod-2,mod))
    
def cmb(n,r,MOD):
    return g1[n]*g2[r]*g2[n-r]%MOD

n,m,k=map(int,input().split())
s=0
t=0
for i in range(1,n):
    s+=i*(n-i)
for i in range(1,m):
    t+=i*(m-i)

ans=(n*n*t+m*m*s)%mod
ans=(ans*cmb(n*m-2,k-2,mod))%mod
print(ans) mod=10**9+7 mod 10**9+7 10**9 10 9 7 MAX=2*10**5+100 MAX 2*10**5+100 2*10**5 2 10**5 10 5 100 g1=[1,1] g1 [1,1] 1 1 g2=[1,1] g2 [1,1] 1 1 for i in range(2,MAX+1):
    num_1=g1[-1]*i%mod
    g1.append(num_1)
    g2.append(pow(num_1,mod-2,mod))
     i range(2,MAX+1) range 2 MAX+1 MAX 1 num_1=g1[-1]*i%mod num_1 g1[-1]*i%mod g1[-1]*i g1[-1] g1 -1 i mod g1.append(num_1) g1.append g1 append num_1 g2.append(pow(num_1,mod-2,mod)) g2.append g2 append pow(num_1,mod-2,mod) pow num_1 mod-2 mod 2 mod def cmb(n,r,MOD):
    return g1[n]*g2[r]*g2[n-r]%MOD cmb return g1[n]*g2[r]*g2[n-r]%MOD g1[n]*g2[r]*g2[n-r]%MOD g1[n]*g2[r]*g2[n-r] g1[n]*g2[r] g1[n] g1 n g2[r] g2 r g2[n-r] g2 n-r n r MOD n n r r MOD MOD n,m,k=map(int,input().split()) n map(int,input().split()) map int input().split() ().split () input split m k s=0 s 0 t=0 t 0 for i in range(1,n):
    s+=i*(n-i) i range(1,n) range 1 n s+=i*(n-i) s i*(n-i) i n-i n i for i in range(1,m):
    t+=i*(m-i) i range(1,m) range 1 m t+=i*(m-i) t i*(m-i) i m-i m i ans=(n*n*t+m*m*s)%mod ans (n*n*t+m*m*s)%mod n*n*t+m*m*s n*n*t n*n n n t m*m*s m*m m m s mod ans=(ans*cmb(n*m-2,k-2,mod))%mod ans (ans*cmb(n*m-2,k-2,mod))%mod ans*cmb(n*m-2,k-2,mod) ans cmb(n*m-2,k-2,mod) cmb n*m-2 n*m n m 2 k-2 k 2 mod mod print(ans) print ans m,k=map(int,input().split()) map(int,input().split()) m t+=i*(m-i) i*(m-i) t n,m,k=map(int,input().split()) map(int,input().split()) n num_1=g1[-1]*i%mod g1[-1]*i%mod num_1 k=map(int,input().split()) map(int,input().split()) k t=0 0 t ans=(n*n*t+m*m*s)%mod (n*n*t+m*m*s)%mod ans mod=10**9+7 10**9+7 mod g2=[1,1] [1,1] g2 ans=(ans*cmb(n*m-2,k-2,mod))%mod (ans*cmb(n*m-2,k-2,mod))%mod ans g1=[1,1] [1,1] g1 def cmb(n,r,MOD):
    return g1[n]*g2[r]*g2[n-r]%MOD def cmb(n,r,MOD):
    return g1[n]*g2[r]*g2[n-r]%MOD cmb s+=i*(n-i) i*(n-i) s s=0 0 s MAX=2*10**5+100 2*10**5+100 MAX
#cmb
mod=10**9+7
MAX=2*10**5+100

g1=[1,1]
g2=[1,1]
for i in range(2,MAX+1):
    num_1=g1[-1]*i%mod
    g1.append(num_1)
    g2.append(pow(num_1,mod-2,mod))
    
def cmb(n,r,MOD):
    return g1[n]*g2[r]*g2[n-r]%MOD

n,m,k=map(int,input().split())
s=0
t=0
for i in range(1,n):
    s+=i*(n-i)
for i in range(1,m):
    t+=i*(m-i)

ans=(n*n*t+m*m*s)%mod
ans=(ans*cmb(n*m-2,k-2,mod))%mod
print(ans)