template originalSource() = # {.checks: off.} include cplib/tmpl/citrus import cplib/modint/modint type mint = modint998244353_barrett var mx = pow(10, 5) * 2 + 1 var fact, fact_inv, inverse = newSeq[mint](mx) fact[0] = 1 fact[1] = 1 fact_inv[0] = 1 fact_inv[1] = 1 inverse[1] = 1 for i in 2.. n: return mint(0) if 0 > n or 0 > k: return mint(0) return fact[n] * (fact_inv[k] * fact_inv[n-k]) var n, k = input(int) var dp = newSeqWith(n+1, mint(0)) var out_num = mint(0) dp[0] = 1 for i in 0..= z.len: break\x0A if (f and (1 shl b)) == 0:\x0A s.add(z[i])\x0A inc i\x0A else:\x0A let d = ord(z[i])*256+ord(z[i+1])\x0A let n = ord(z[i+2])+3\x0A i += 3\x0A for j in 0..