"""

https://yukicoder.me/problems/no/2527



"""

import math
import sys
from sys import stdin

def modfac(n, MOD):
 
    f = 1
    factorials = [1]
    for m in range(1, n + 1):
        f *= m
        f %= MOD
        factorials.append(f)
    inv = pow(f, MOD - 2, MOD)
    invs = [1] * (n + 1)
    invs[n] = inv
    for m in range(n, 1, -1):
        inv *= m
        inv %= MOD
        invs[m - 1] = inv
    return factorials, invs


def modnCr(n,r): #上で求めたfacとinvsを引数に入れるべし(上の関数で与えたnが計算できる最大のnになる)
    return fac[n] * inv[n-r] * inv[r] % mod

mod = 998244353
fac,inv = modfac(10**6+100,mod)

H,W,K = map(int,stdin.readline().split())
K = H*W-K
ans = 0

for t in range(H+1):

    rem = K - W*t

    tate = H-t

    if rem >= 0 and rem % tate == 0:
        ans += modnCr(H,t) * modnCr(W,rem//tate)
        ans %= mod

print (ans)