P11847 [USACO25FEB] True or False Test P

****Note: The time limit for this problem is 3s, 1.5x the default. The memory limit for this problem is 512MB, twice the default.**** Bessie is taking an $N$-question true or false test ($1\le N\le 2\cdot 10^5$). For the $i$-th question, she will gain $a_i$ points if she gets it correct, lose $b_i$ points if she gets it incorrect, or remain even if she does not answer it ($0

The first line contains $N$ and $Q$. The next $N$ lines each contain $a_i$ and $b_i$. The next $Q$ lines each contain a value of $k$. No value of $k$ appears more than once.

The answer for each $k$ on a separate line.

For each value of $k$, it is optimal for Bessie to answer all of the questions. #### SCORING: - Inputs 2-4: $N\le 100$ - Inputs 5-7: $Q\le 10$, $N\le 2\cdot 10^5$ - Inputs 7-20: No additional constraints.