Mod=998244353
H,W,K=map(int,input().split())
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]

l=make_divisors(K)
# print(l)
facts=[]
inv_facts=[]
t=1
for i in range(10**6+1):
    facts.append(t)
    t=t*(i+1)%Mod
inv_facts.append(pow(facts[10**6],-1,Mod))
for i in range(10**6):
    inv_facts.append(inv_facts[-1]*(10**6-i)%Mod)
inv_facts.reverse()
ans=0
for s in l:
    a=s
    b=K//a
    if(a>H or b>W):
        continue
    else:
        ans+=(facts[H]*inv_facts[a]*inv_facts[H-a]%Mod)*(facts[W]*inv_facts[b]*inv_facts[W-b]%Mod)%Mod
print(ans%Mod)