def divisor(n):
    ass = []
    for i in range(1,int(n**0.5)+1):
        if n%i == 0:
            ass.append(i)
            if i**2 == n:
                continue
            ass.append(n//i)
    ass.sort()
    return ass

def cmb_init(N, p):
    fact = [1, 1]
    factinv = [1, 1]
    inv = [0, 1]

    for i in range(2, N + 1):
        fact.append((fact[-1] * i) % p)
        inv.append((-inv[p % i] * (p // i)) % p)
        factinv.append((factinv[-1] * inv[-1]) % p)
    return [fact, factinv, p]

def cmb(n, r, f):
    if n < r:
        return 0
    return f[0][n] * f[1][r] * f[1][n-r] % f[2]

h,w,k = map(int,input().split())
f = cmb_init(2*max(h, w)+1, 998_244_353)
ans = 0
for p1 in divisor(k):
    p2 = k // p1
    if p1 > h or p2 > w:
        continue
    ans += cmb(h, p1, f) * cmb(w, p2, f)
    ans %= 998_244_353
print(ans)