mod = 998244353
h, w, k = [int(x) for x in input().split()]
if h > w:
	h, w = w, h
fc = [1]
for i in range(1, w + 1):
	fc.append(fc[-1] * i % mod)
hw_rem = []
ans = 0
for i in range(1, h + 1):
	if k % i == 0:
		hw_rem.append(i)
for x in hw_rem:
	a = fc[h] * pow(fc[h-x], -1, mod) * pow(fc[x], -1, mod)
	y = k // x
	b = fc[w] * pow(fc[w-y], -1, mod) * pow(fc[y], -1, mod)
	ans += a + b
	ans %= mod
print(ans)