MOD = 998244353
fac = [1] * (1 * 10 ** 6 + 1)
for i in range(len(fac) - 1):
    fac[i + 1] = fac[i] * (i + 1) % MOD

def comb(n, k):
    if k < 0 or n < k:
        return 0
    return fac[n] * pow(fac[n - k] * fac[k], MOD - 2, MOD) % MOD

def devisors(n):
    d = []
    a = 1
    while a * a < n:
        if n % a == 0:
            d.append(a)
            d.append(n // a)
        a += 1
    if a * a == n:
        d.append(a)
    return d

h, w, k = map(int, input().split())
ans = 0
for d in devisors(k):
    x, y = d, k // d
    ans += comb(h, x) * comb(w, y)
print(ans % MOD)