h,w,k = map(int,input().split())

mod = 998244353


### for bigger prime 
N = max(h,w)+5
fact = [1]*N
finv = [1]*N
 
for i in range(2,N):
    fact[i] = (fact[i-1]*i)%mod
finv[-1] = pow(fact[-1],mod-2,mod)
for i in range(1,N)[::-1]:
    finv[i-1] = (finv[i]*i)%mod

def nCr(n,r):
    if r > n:
        return 0
    else: 
        return fact[n]*finv[r]%mod*finv[n-r]%mod


ans = 0

for i in range(h+1):

    now = h * w - i * w

    if now < k:
        break

    need = now - k

    if need % (h-i):
        continue

    r = need // (h-i)

    if r > w:
        continue

    ans += nCr(h,i) * nCr(w,r) % mod
    ans %= mod
print(ans)