Union of Segments

There are $N$ segments. The $i$-th segment has price $P_i$ and length $L_i$.

There are $Q$ queries. For each query, determine whether you can choose a set of segments that satisfies the following condition.

• Choose a set of segments whose total price is exactly $A_j$. Place the chosen segments on a one-dimensional number line, where segments may overlap. Can the length of the union of the segments be exactly $B_j$?

The first line contains two integers $N$ and $Q$, separated by a space. ($1 \le N \le 100$; $1 \le Q \le 200\,000$)

The next $N$ lines each contain two integers $P_i$ and $L_i$, separated by a space. ($1 \le P_i \le 10\,000$; $1 \le L_i \le 10\,000$)

The next $Q$ lines each contain two integers $A_j$ and $B_j$, separated by a space. ($1 \le A_j \le 10^6$; $1 \le B_j \le 10^6$)

For each query, print YES if you can choose a set of segments that satisfies the condition, otherwise print NO. Print one answer per line, in the order the queries are given.