import sys

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 + 2):
	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:
	y = w - k // x
	if y < 0: continue
	a = fc[h] * pow(fc[h-x], mod - 2, mod) * pow(fc[x], mod - 2, mod) % mod
	b = fc[w] * pow(fc[w-y], mod - 2, mod) * pow(fc[y], mod - 2, mod) % mod
	ans += a * b
	ans %= mod
print(ans)