Max Size

You are given an array $A$ of $N$ integers - $[A_1, A_2, \ldots, A_N]$, and $Q$ queries: - You are given $2$ integers $X$ and $Y$. - Consider the prefix of $A$ of size $X$ - $[A_1, A_2, \ldots, A_X]$. Let's represent this array by $B$. - Find the maximum size of a subset of $B$ which has a sum $\le Y$. Note that if the prefix of $A$ contains any element multiple times, it may appear in the ch