h,w,k = map(int,input().split())
nmax = max(h,w); mod = 998244353; fa = [1]*(nmax+1); fi = [1]*(nmax+1)
for i in range(1,nmax): fa[i+1] = fa[i]*(i+1)%mod
fi[nmax] = pow(fa[nmax],mod-2,mod)
for i in range(nmax,0,-1): fi[i-1] = fi[i]*i%mod
def cmb(n,r): return fa[n]*fi[n-r]%mod*fi[r]%mod if 0<=r<=n else 0
x = 0
for i in range(h):
    if k%(h-i)==0: x = (x+cmb(h,i)*cmb(w,k//(h-i)))%mod
print(x)