def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p

p=998244353
N = 10**6+1  # N は必要分だけ用意する
fact = [1, 1]  # fact[n] = (n! mod p)
factinv = [1, 1]  # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1]  # factinv 計算用S
 
for i in range(2, N + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p)

H,W,K=map(int,input().split())
K=H*W-K
ans=0
p=998244353
for i in range(H+1):
    if i==H:
        if H*W==K:
            ans+=1
            ans%=p
        continue
    if (K-W*i)%(H-i)==0 and (K-W*i)//(H-i)<=W:
        ans+=cmb(H,i,p)*cmb(W,(K-W*i)//(H-i),p)
        ans%=p
print(ans)