def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]


p = 998244353
fact = [1, 1]  # fact[n] = (n! mod p)
factinv = [1, 1]  # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1]  # factinv 計算用

H,W,K = map(int,input().split())
mod = 998244353
D = make_divisors(K)

def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p

for i in range(2, max(W,H) + 1):
    fact.append((fact[-1] * i) % mod)
    inv.append((-inv[p % i] * (p // i)) % mod)
    factinv.append((factinv[-1] * inv[-1]) % mod)

ans = 0

for d in D:
    if d<=H and K//d<=W:
        ans = (ans + cmb(H,d,mod)*cmb(W,K//d,mod) ) % mod
print(ans)