Problem:
Score : 500 points

Problem Statement

There are N cards. The i-th card has an integer A_i written on it.
For any two cards, the integers on those cards are different.

Using these cards, Takahashi and Aoki will play the following game:

Aoki chooses an integer x.

Starting from Takahashi, the two players alternately take a card. The card should be chosen in the following manner:

Takahashi should take the card with the largest integer among the remaining card.

Aoki should take the card with the integer closest to x among the remaining card. If there are multiple such cards, he should take the card with the smallest integer among those cards.

The game ends when there is no card remaining.

You are given Q candidates for the value of x: X_1, X_2, ..., X_Q.
For each i (1 \leq i \leq Q), find the sum of the integers written on the cards that Takahashi will take if Aoki chooses x = X_i.

Constraints

2 \leq N \leq 100 000

1 \leq Q \leq 100 000

1 \leq A_1 < A_2 < ... < A_N \leq 10^9

1 \leq X_i \leq 10^9 (1 \leq i \leq Q)

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N Q
A_1 A_2 ... A_N
X_1
X_2
:
X_Q

Output

Print Q lines. The i-th line (1 \leq i \leq Q) should contain the answer for x = X_i.

Sample Input 1

5 5
3 5 7 11 13
1
4
9
10
13

Sample Output 1

31
31
27
23
23

For example, when x = X_3(= 9), the game proceeds as follows:

Takahashi takes the card with 13.

Aoki takes the card with 7.

Takahashi takes the card with 11.

Aoki takes the card with 5.

Takahashi takes the card with 3.

Thus, 13 + 11 + 3 = 27 should be printed on the third line.

Sample Input 2

4 3
10 20 30 40
2
34
34

Sample Output 2

70
60
60

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <sstream>
#include <cassert>
#include <queue>
#include <bitset>
#include <ctime>
using namespace std;
#define forr(i, a, b) for(int i = (a); i < (int) (b); i++)
#define forn(i, n) forr(i, 0, n)
#define db(v) cerr << #v << " = " << v << endl
#define pb push_back
#define sz(x) ((int)x.size())
#define fst first
#define snd second
typedef long long ll;
typedef pair<int, int> ii;
const int MAXN = 100050;

int n, q, A[MAXN], x;
ll add[MAXN], alt[MAXN];

ll suf(int p){
	return add[n]-add[p];
}

int main(){
	while(scanf("%d %d", &n, &q) >= 1){
		memset(add, 0, sizeof(add));
		memset(alt, 0, sizeof(alt));
		forn(i, n){
			scanf("%d", &A[i]);
			add[i+1] = add[i] + A[i];
			alt[i+1] = (i?alt[i-1]:0)+A[i];
		}
		forn(z, q){
			scanf("%d", &x);
			ll ans = 0;
			int a = -1;
			int b = (int)2e9 + 9901;
			while(b - a > 1){
				int c = a + (b - a) / 2;
				
				int left = x - (c+1)/2;
				int right = x + 1 + c/2;
				int itl = lower_bound(A, A+n, left) - A;
				int itr = lower_bound(A, A+n, right) - A;
				ii aoki = {itl, itr}; int len = (itr-itl);
				ii taka = {n-len, n};
				//~ printf("[%d, %d) = ranges [%d, %d), [%d, %d)\n", left, right, aoki.fst, aoki.snd, taka.fst, taka.snd);
				// take care of case both empty sets...
				ii inter = {max(aoki.fst, taka.fst), min(aoki.snd, taka.snd)};
				int dif = inter.snd - inter.fst;
				//~ printf("DIF = %d\n", dif);
				if(len == 0){
					a = c;
				} else if(dif >= 1){
					b = c;
					if(dif == 1 && len == 1){
						if(!ans) ans = alt[n];
					}
				} else if(dif == 0){
					//~ printf("[%d, %d) vs [%d, %d) = %lld + %lld\n", aoki.fst, aoki.snd, taka.fst, taka.snd, alt[aoki.fst], suf(taka.fst));
					ans = alt[aoki.fst] + suf(taka.fst);
					break;
				} else if(dif == -1){
					ans = (add[aoki.fst]-alt[aoki.fst]) + suf(taka.fst-1);
					break;
				} else {
					a = c;
				}
			}
			printf("%lld\n", ans);
		}
	}	
	return 0;
}