x = 10**6 + 1
mod = 998244353
fact = [None] * (x + 1)  # mod(n)での階乗
inv = [None] * (x + 1)  # mod(n)での逆元
fact_inv = [None] * (x + 1)  # mod(n)での階乗の逆元

fact[0] = fact[1] = 1
inv[1] = 1
fact_inv[0] = fact_inv[1] = 1

for i in range(2, x + 1):
    fact[i] = (fact[i - 1] * i) % mod
    inv[i] = (-inv[mod % i] * (mod // i)) % mod
    fact_inv[i] = (fact_inv[i - 1] * inv[i]) % mod


def comb(n, r):
    if r > n:
        return 0
    return (fact[n] * fact_inv[n - r] % mod) * fact_inv[r] % mod


h, w, k = map(int, input().split())

red = h * w - k
ans = 0
for i in range(h + 1):
    if w * i > red:
        break
    num = red - w * i
    if num % (h - i) == 0:
        ww = num // (h - i)
        ans += comb(h, i) * comb(w, ww)
        ans %= mod

print(ans)