import math
H, W, K = map(int, input().split())
kai = [1] * (H + W + 1)
fkai = [1] * (H + W + 1)
mod = 998244353
for i in range(H + W) :
    kai[i + 1] = (kai[i] * (i + 1)) % mod
fkai[H + W] = pow(kai[H + W], -1, mod)
for i in range(H + W, 0, -1) :
    fkai[i - 1] = (fkai[i] * i) % mod
def comb(n : int, r : int) -> int :
    if r < 0 or n < r :
        return 0
    ret = kai[n] * fkai[r] * fkai[n - r]
    return ret % mod
ans = 0
for h in range(1, H + 1) :
    if K % h :
        continue
    w = K // h
    ans += comb(H, h) * comb(W, w)
    ans %= mod
print(ans)