H,W,K = map(int,input().split())
C = 10 ** 6 + 5

P = 998244353
fact = [1] * C
fact_inv = [1] * C
for i in range(2,C):
    fact[i] = fact[i-1] * i % P
fact_inv[-1] = pow(fact[-1],P - 2,P)
for i in range(C - 2,0,-1):
    fact_inv[i] = fact_inv[i + 1] * (i + 1)  % P
def comb(n,k):
    return fact[n] * fact_inv[k] % P * fact_inv[n - k] % P

#hW + wH - hw = HW - K
#w = (HW - K - hW) / (H - h)

ans = 0
import sys
if K == 0:
    print(1)
    exit()
for h in range(H):
    U = H * W - K - h * W
    if U < 0:continue
    V = H - h
    if U % V == 0:
        w = U // V
        ans += comb(H,h) * comb(W,w) % P
        ans %= P
print(ans)