Squeeze OR

Chef has an array $A$ of $N$ integers. He asks you $Q$ queries. For each query, you are given the following: - An integer $X$ $(0 \leq X \lt 2^{20})$. - An array $B$ of size $M$ such that $1 \leq B_j\leq N$. You need to erase **minimum** number of elements from $A$ such that the [bitwise-OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) of the remaining elements is **at most** $X$ and no