mod = 998244353
n = 2 * 10 ** 6 + 5
fact = [1] * (n + 1)
invfact = [1] * (n + 1)
for i in range(1, n):
    fact[i + 1] = ((i+1) * fact[i]) % mod
invfact[n] = pow(fact[n], mod - 2, mod)
for i in range(n - 1, -1, -1):
    invfact[i] = invfact[i + 1] * (i + 1) % mod

def comb(n, r):
    if n < 0 or r < 0 or n - r < 0:
        return 0
    return fact[n] * invfact[r] * invfact[n - r] % mod


H, W, K = map(int, input().split())
K = H * W - K
ans = 0
for h in range(H):
    if K - h * W < 0:
        break
    if (K - h * W) % (H - h) != 0:
        continue
    w = (K - h * W) // (H - h)
    ans += comb(H, h) * comb(W, w)
    ans %= mod
    
if K == H * W:
    ans += pow(2, W, mod)
    ans %= mod
    
print(ans)