N,m,k = (int(i) for i in input().split())
n,mod,x,y = N*m,10**9+7,0,0
fn,fk = [1]*n,[1]*n
for i in range(n-1): fn[i+1] = (fn[i]*(i+2))%mod
def power(n,k):
	if k==1: return n
	elif k%2==0: return power((n**2)%mod,k//2)
	else: return (n*power(n,k-1))%mod
def comb(n,k):
	if n==0 or k==0 or n==k: return 1
	else: return (((fn[n-1]*fk[n-k-1])%mod)*fk[k-1])%mod
fk[-1] = power(fn[-1],mod-2)
for i in range(2,n+1): fk[-i] = (fk[-i+1]*(n+2-i))%mod
for i in range(N): x+=i*(N-i)*(m**2)
for i in range(m): y+=i*(m-i)*(N**2)
print(comb(n-2,k-2)*(x+y)%mod) int(i) for i in input().split() for i in input().split() i input().split() ().split () input split for i in input().split() int(i) int i N,m,k = (int(i) for i in input().split()) N (int(i) for i in input().split()) m k n,mod,x,y = N*m,10**9+7,0,0 n N*m N m mod 10**9+7 10**9 10 9 7 x 0 y 0 fn,fk = [1]*n,[1]*n fn [1]*n [1] 1 n fk [1]*n [1] 1 n for i in range(n-1): fn[i+1] = (fn[i]*(i+2))%mod i range(n-1) range n-1 n 1 def power(n,k):
	if k==1: return n
	elif k%2==0: return power((n**2)%mod,k//2)
	else: return (n*power(n,k-1))%mod power if k==1: return n
	elif k%2==0: return power((n**2)%mod,k//2)
	else: return (n*power(n,k-1))%mod k==1 k 1 elif k%2==0: return power((n**2)%mod,k//2)
	 k%2==0 k%2 k 2 0 n n k k def comb(n,k):
	if n==0 or k==0 or n==k: return 1
	else: return (((fn[n-1]*fk[n-k-1])%mod)*fk[k-1])%mod comb if n==0 or k==0 or n==k: return 1
	else: return (((fn[n-1]*fk[n-k-1])%mod)*fk[k-1])%mod n==0 or k==0 or n==k n==0 or k==0 n==0 n 0 k==0 k 0 n==k n k n n k k fk[-1] = power(fn[-1],mod-2) fk[-1] fk -1 power(fn[-1],mod-2) power fn[-1] fn -1 mod-2 mod 2 for i in range(2,n+1): fk[-i] = (fk[-i+1]*(n+2-i))%mod i range(2,n+1) range 2 n+1 n 1 for i in range(N): x+=i*(N-i)*(m**2) i range(N) range N for i in range(m): y+=i*(m-i)*(N**2) i range(m) range m print(comb(n-2,k-2)*(x+y)%mod) print comb(n-2,k-2)*(x+y)%mod comb(n-2,k-2)*(x+y) comb(n-2,k-2) comb n-2 n 2 k-2 k 2 x+y x y mod N,m,k = (int(i) for i in input().split()) (int(i) for i in input().split()) N fn,fk = [1]*n,[1]*n [1]*n fn fk = [1]*n,[1]*n [1]*n fk def comb(n,k):
	if n==0 or k==0 or n==k: return 1
	else: return (((fn[n-1]*fk[n-k-1])%mod)*fk[k-1])%mod def comb(n,k):
	if n==0 or k==0 or n==k: return 1
	else: return (((fn[n-1]*fk[n-k-1])%mod)*fk[k-1])%mod comb x,y = N*m,10**9+7,0,0 0 x m,k = (int(i) for i in input().split()) (int(i) for i in input().split()) m k = (int(i) for i in input().split()) (int(i) for i in input().split()) k n,mod,x,y = N*m,10**9+7,0,0 N*m n y = N*m,10**9+7,0,0 0 y mod,x,y = N*m,10**9+7,0,0 10**9+7 mod def power(n,k):
	if k==1: return n
	elif k%2==0: return power((n**2)%mod,k//2)
	else: return (n*power(n,k-1))%mod def power(n,k):
	if k==1: return n
	elif k%2==0: return power((n**2)%mod,k//2)
	else: return (n*power(n,k-1))%mod power
N,m,k = (int(i) for i in input().split())
n,mod,x,y = N*m,10**9+7,0,0
fn,fk = [1]*n,[1]*n
for i in range(n-1): fn[i+1] = (fn[i]*(i+2))%mod
def power(n,k):
	if k==1: return n
	elif k%2==0: return power((n**2)%mod,k//2)
	else: return (n*power(n,k-1))%mod
def comb(n,k):
	if n==0 or k==0 or n==k: return 1
	else: return (((fn[n-1]*fk[n-k-1])%mod)*fk[k-1])%mod
fk[-1] = power(fn[-1],mod-2)
for i in range(2,n+1): fk[-i] = (fk[-i+1]*(n+2-i))%mod
for i in range(N): x+=i*(N-i)*(m**2)
for i in range(m): y+=i*(m-i)*(N**2)
print(comb(n-2,k-2)*(x+y)%mod)