Problem I
Ding Dong Ditch

Raunak and his friends want to play a prank on their neighbors by performing the classic "Ding Dong Ditch". They want to individually ring the doorbell of a number of their neighbors and then run away from there. But some neighbors are very dangerous, since they could get very angry and even potentially bite you!

There are $N$ neighbors that live on their street. For each neighbor $i$, the neighbor has a value $A_i$ that represents how angry they become when their doorbell is rung. Raunak has $Q$ friends, including himself. For each friend $j$ they have a specific level of ambition $B_j$, which represents the number of houses they can ring the doorbell on before chickening out.

For each friend who rings the doorbell, they want to choose $B_j$ different houses that minimizes the sum of the anger values $A_i$ of all of those houses. Help Raunak figure out the smallest possible sum of anger values that each friend can achieve!

Note that multiple friends may ring the doorbell of the same house.

Input

The first line consists of two positive integers $N,Q$ ($1⩽N⩽2\cdot {10}^5$, $1⩽Q⩽{10}^5$), the number of houses in the neighborhood and the number of friends that Raunak has, respectively. The next line consists of $N$ distinct positive integers separated by spaces, where each integer $1⩽A_i⩽{10}^9$ represents the anger value of each neighbor. The last line consists of $Q$ positive integers separated by spaces, where each integer $1⩽B_j⩽N$ represents how many houses that friend $j$ can ring the doorbell of.

Output

Print $Q$ lines, where each line consists of an integer - The smallest sum of anger value that friend $j$ can achieve by ringing $B_j$ doorbells.

Grading

Your solution will be tested on a number of test-case groups. To receive points for a group, your solution must correctly solve every test-case in the group.

4 2
3 2 1 4
3 1

6
1

5 1
12 2 14 6 9
3

17