Random Knapsack

You are given $N = 240$ integers, randomly generated in $[0; 998\,244\,353)$. You need to answer $Q$ queries, in each query, you are given one integer $X$, $0 \leq X < 998\,244\,353$. And you need to find a subset of given integers with sum $X$, modulo $998\,244\,353$. For each test case, it is guaranteed that at least one such subset exists. ###Input: - The first line contains one int