# Kを約数の積に分解、それぞれの約数をH, Wから選ぶ組合せ数
# nCrメモ化パッケージ、約数列挙

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

# nCrメモ化パッケージ
factorial = [1] #0分
inverse = [1] #0分
for i in range(1, max(H, W)+1):
    factorial.append(factorial[-1]*i%mod)
    inverse.append(pow(factorial[-1], mod-2, mod))
    
def nCr_fast(N, R, MOD):
    if N < R or R < 0:
        return 0
    elif R == 0 or R == N:
        return 1
    return factorial[N]*inverse[R]*inverse[N-R]%MOD

def 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]

ans = 0
divs = divisors(K)
for d1 in divs:
    d2 = K//d1
    calc = nCr_fast(H, d1, mod)*nCr_fast(W, d2, mod)
    calc %= mod
    ans += calc
    ans %= mod
print(ans)