MOD  = 998244353i64
FACT = [1i64]
1000001.times do |i|
  FACT << FACT[i] * (i + 1) % MOD
end
FACT_INV = Array.new(FACT.size, 0i64)
FACT_INV[-1] = inv(FACT[-1])
(FACT_INV.size - 2).downto(0) do |i|
  FACT_INV[i] = FACT_INV[i + 1] * (i + 1) % MOD
end

def binom(n, k)
  FACT[n] * FACT_INV[k] % MOD * FACT_INV[n - k] % MOD
end

def inv(v)
  pow(v, MOD - 2)
end

def pow(v, p)
  ret = 1i64
  while p > 0
    if (p & 1i64) != 0
      ret *= v
      ret %= MOD
    end
    v *= v
    v %= MOD
    p >>= 1
  end
  ret
end

h, w, k = read_line.split.map(&.to_i64)
c = h * w - k
ans = 0i64
0.upto(h) do |i|
  rest = c - (w * i)
  break if rest < 0
  if rest % (h - i) == 0
    u = rest // (h - i)
    ans += binom(h, i) * binom(w, u)
    ans %= MOD
  end
end
puts ans