# TLE AND RE
# O(H*W + K)

mod = 998244353
N = 10**6 + 5
fact = [1]*(N+1)
factinv = [1]*(N+1)

for i in range(2, N+1):
	fact[i] = fact[i-1] * i % mod

factinv[-1] = pow(fact[-1], mod-2, mod)
for i in range(N-1, 1, -1):
	factinv[i] = factinv[i+1] * (i+1) % mod

def cmb(a, b):
	if (a < b) or (b < 0):
		return 0
	return fact[a] * factinv[b] % mod * factinv[a-b] % mod

h,w,k = map(int,input().split())
l = [0] * (min(h,w) + 2)

for a in range(1, min(h,w)+1):
	l[a] = cmb(h,a) * cmb(w,a) % mod * fact[a] % mod * fact[h*w-a] % mod

#print(l)

ans = 0
for a in range(2, min(h,w)+2):
	ans += (l[a-1] - l[a]) * a % mod * cmb(h*w,a) % mod * fact[a+k-1] % mod * fact[h*w-a] % mod * factinv[h*w+k] % mod
	#print(ans)

print(ans * factinv[h*w] % mod)