#define _CRT_SECURE_NO_WARNINGS

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <limits>
#include <ctime>
#include <cassert>
#include <map>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <stack>
#include <queue>
#include <numeric>
#include <iterator>
#include <bitset>
#include <unordered_map>
#include <unordered_set>

using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const string& x, char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T, class S, class U, class V> void writerLn(T x, S y, U z, V v) { writer(x, ' '); writer(y, ' '); writer(z, ' '); writer(v, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }

template<class T> void chmin(T& a, const T& b) { if (a > b) a = b; }
template<class T> void chmax(T& a, const T& b) { if (a < b) a = b; }

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
	ll ret = 1;
	ll p = a % mod;
	while (n) {
		if (n & 1) ret = ret * p % mod;
		p = p * p % mod;
		n >>= 1;
	}
	return ret;
}
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
ll mod_inv(ll a, ll m) { ll x, y; extgcd<ll>(a, m, x, y); return (m + x % m) % m; }

#ifdef _DEBUG
template <typename ... Args>
void debugPrintf(const char *format, Args const & ... args) {
	fprintf(stdout, format, args ...);
	fflush(stdout);
}
#else
#define debugPrintf(...)
#endif

ll a[ten(5) + 10];
ll sa[ten(5) + 10];
ll evenSa[ten(5) + 10];

void init(int n) {
	FOR(i, n) sa[i + 1] = sa[i] + a[i];
	FOR(i, n) {
		evenSa[i + 1] = evenSa[i];
		if (i % 2 == 0) evenSa[i + 1] += a[i];
	}
}

Pii f(int n, ll md, ll x) {
	ll lower = md / 2;
	ll upper = md - lower;
	int lid = lower_bound(a, a + n, x - lower) - a;
	int rid = lower_bound(a, a + n, upper + x) - a;

	return Pii(lid, rid);
}

ll naive(int n, ll x) {
	set<ll> s(a, a + n);
	ll ret = 0;
	FOR(i, n) {
		if (i % 2 == 0) {
			ret += *s.rbegin();
			s.erase(--s.end());
		} else {
			auto it = s.lower_bound(x);
			if (it == s.end()) {
				s.erase(--s.end());
			} else if (it == s.begin()) {
				s.erase(it); 
			} else {
				auto it2 = it;
				it2--;
				if (abs(x - *it2) <= abs(x - *it)) {
					s.erase(it2);
				} else {
					s.erase(it);
				}
			}
		}
	}

	return ret;
}

ll solve(int n, ll x) {
	ll l = 0, r = 2 * ten(9) + 10;
	while (r - l != 1) {
		ll md = (l + r) / 2;

		int lid, rid;
		tie(lid, rid) = f(n, md, x);

		int aokiUsed = rid - lid;
		int takahashiUsed = n - rid;
		if (aokiUsed <= takahashiUsed) {
			l = md;
		} else {
			r = md;
		}
	}

	int lid2, rid2;
	tie(lid2, rid2) = f(n, l, x);

	ll firstUsed = sa[n] - sa[rid2];
	if (lid2 == 0) {
		return firstUsed;
	}

	ll secondUsed = 0;
	int aokiUsed = rid2 - lid2;
	int takahashiUsed = n - rid2;
	if (aokiUsed + 1 == takahashiUsed) {
		lid2--;
	}

	if (lid2 % 2 == 0) {
		secondUsed = sa[lid2] - evenSa[lid2];
	} else {
		secondUsed = evenSa[lid2];
	}

	return firstUsed + secondUsed;
}

void test() {
	while (true) {
		int n = 10;
		FOR(i, n) a[i] = rand() % 5 + 1;
		a[0] = ten(9) - ten(3);
		FOR(i, n - 1) a[i + 1] += a[i];
		sort(a, a + n);
		init(n);
		FOR(i, 100) {
			int x = rand();
			ll ans = solve(n, x);
			ll ans2 = naive(n, x);
			if (ans != ans2) {
				cout << "?";
			}
		}
	}
}

int main() {
	// test();

	int n, q; reader(n, q);
	FOR(i, n) reader(a[i]);
	init(n);

	FOR(i, q) {
		ll x; reader(x);
		ll ans = solve(n, x);
		writerLn(ans);
	}


	return 0;
}


Measured memory_bytes: 4096