H,W,K = map(int,input().split())
L = max(H,W)
MOD = 998244353
A = list(range(L+1))
A[0]=A[1]=1
for i in range(2,L+1):
    A[i]=(i*A[i-1])%MOD
B = [0]*(L+1)
B[0]=B[1]=1
B[L] = pow(A[L],MOD-2,MOD)
for i in range(L-1,1,-1):
    B[i] = (B[i+1]*(i+1))%MOD
def comb(n,k):
    if k>n or k<0:return 0
    if k==0 or k==n:return 1
    return (A[n]*B[k]*B[n-k])%MOD
ans = 0
for i in range(1,K+1):
    if i*i>K:break
    if K%i==0:
        n1 = i
        n2 = K//i
        if n1<=H and n2<=W and n1!=n2:
            ans = (ans+(comb(H,n1)*comb(W,n2))%MOD)%MOD
        if n2<=H and n1<=W and n1!=n2:
            ans = (ans+(comb(H,n2)*comb(W,n1))%MOD)%MOD
        if n1<=H and n2<=W and n1==n2:
            ans = (ans+(comb(H,n1)*comb(W,n2))%MOD)%MOD
print(ans)