mod=998244353
h,w,m=map(int,input().split())
if m<h+w-1:
	print(0)
	exit()
def fact(x):
	ret=1
	for i in range(1,x+1):
		ret=(ret*i)%mod
	return ret
C=fact(h+w-2)*pow(fact(h-1)*fact(w-1),-1,mod)
D=1
for i in range(m,m-h-w+1,-1):
	D=(D*i)%mod
D=D*pow(fact(h+w-1),-1,mod)
ans=C*D*pow(m,h*w-(h+w-1),mod)%mod
print(ans)