MOD = 998244353


def make_divisors(n):
    divisors = []  # 必要に応じてsetにしても良いかも
    i = 1
    while i ** 2 <= n:
        if n % i == 0:
            divisors.append(i)
            if i ** 2 != n:
                divisors.append(n // i)
        i += 1
    divisors.sort()
    return divisors


N = 10 ** 6
fact = [1] * (N + 1)
rfact = [1] * (N + 1)
r = 1
for i in range(1, N + 1):
    fact[i] = r = r * i % MOD
rfact[N] = r = pow(fact[N], MOD - 2, MOD)
for i in range(N, 0, -1):
    rfact[i - 1] = r = r * i % MOD


def comb(n, k):
    return fact[n] * rfact[k] * rfact[n - k] % MOD

H, W, K = map(int, input().split())
D = make_divisors(K)
ans = 0
for d in D:
    d2 = K // d
    if d <= H and d2 <= W:
        ans += comb(H, d) * comb(W, d2)
        ans %= MOD
print(ans)