class CP:
    def __init__(self, N):
        self.fact = [1]
        self.fact_inv = [1]
        for i in range(1, N+1):
            self.fact.append((self.fact[-1]*i)%MOD)
            self.fact_inv.append(pow(self.fact[-1], -1, MOD))
    def C(self, N, K):
        if N >= K:
            return self.fact[N]*self.fact_inv[K]%MOD*self.fact_inv[N-K]%MOD
        else:
            return 0
    def P(self, N, K):
        if N >= K:
            return self.fact[N]*self.fact_inv[N-K]%MOD
        else:
            return 0

H, W, K = map(int, input().split())

ans = 0
MOD = 998244353
cp = CP(max(H, W))
for h in range(H+1):
    cnt = (H-h)*W
    if cnt < K:
        continue
    diff = cnt-K
    if diff%(H-h) == 0 and 0 <= diff//(H-h) <= W:
        cntH = h
        cntW = diff//(H-h)
        ans += cp.C(H, cntH)*cp.C(W, cntW)%MOD
        ans %= MOD

print(ans)