max_N = 10**6+1
MOD = 998244353
fact    =[None] * (max_N+1) #MOD下での階乗
inv     =[None] * (max_N+1) #MOD下での逆元
fact_inv=[None] * (max_N+1) #MOD下での階乗の逆元
fact[0]=fact[1]=1
inv[1] = 1
fact_inv[0]=fact_inv[1] = 1
for i in range(2,max_N+1):
    fact[i] = (fact[i-1]*i)%MOD
    inv[i] = (-inv[MOD%i]*(MOD//i))%MOD
    fact_inv[i] = (fact_inv[i-1]*inv[i])%MOD

def nCr(n,r):
    if r > n:
        return 0
    return (fact[n]*fact_inv[n-r]%MOD)*fact_inv[r]%MOD

H,W,K = map(int,input().split())
def solve(h,w):
    return nCr(H,h)*nCr(W,w)

i = 1
ans = 0
while i*i <= K:
    if K%i == 0:
        ans += solve(i,K//i)
        if i != K//i:
            ans += solve(K//i,i)
        ans %= 998244353
    i += 1
print(ans)