#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const deque<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class T,size_t n> ostream& operator<<(ostream &os, const array<T,n> &t) {
	os<<"{"; rep(i,n) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T,class U> ostream& operator<<(ostream &os, const tuple<S,T,U> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class S, class T,class U,class V> ostream& operator<<(ostream &os, const tuple<S,T,U,V> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<","<<get<3>(t)<<")";}
template<class S, class T,class U,class V,class W> ostream& operator<<(ostream &os, const tuple<S,T,U,V,W> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<","<<get<3>(t)<<","<<get<4>(t)<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string &s, char c){vector<string> v;int d=0,f=0;string t;for(char c:s){if(!d&&c==',')v.pb(t),t="";else t+=c;if(c=='\"'||c=='\'')f^=1;if(!f&&c=='(')++d;if(!f&&c==')')--d;}v.pb(t);return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
#else
#define out
#endif
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
const ll MOD=1e9+7;

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
	int n,q;
	cin>>n>>q;
	// n=q=100;
	vector<ll> a(n),qs(q);
	rep(i,n) cin>>a[i];
	rep(i,q) cin>>qs[i];
	// rep(i,n) a[i]=rand();
	// sort(all(a));
	// rep(i,q) qs[i]=rand();
	ll poyo=0,left=0;
	rep(i,n)if(i%2==0) poyo+=a[n-1-i];
	reps(i,n/2,n) left+=a[i];
	vector<ll> odd(n+1),even(n+1);
	rep(i,n){
		if(i%2) odd[i+1]+=a[i];
		else even[i+1]+=a[i];
		odd[i+1]+=odd[i];
		even[i+1]+=even[i];
	}
	for(ll x:qs){
		if(x>=a[n-2]){
			cout<<poyo<<"\n";
			continue;
		}
		if(x<=a[0]){
			cout<<left<<"\n";
			continue;
		}
		int l=lower_bound(all(a),x)-a.begin()-1;
		int r=n;
		out(x,l,r,1);
		while(r-l>1){
			int m=(l+r)/2;
			int t=m-(lower_bound(all(a),x-(a[m]-x))-a.begin())+1;
			(m+t<n?l:r)=m;
		}
		out(x,l,r,1);
		ll re=odd[n]-odd[r]+even[n]-even[r];
		int t=max(0,r-(n-r));
		if(t%2){
			re+=even[t];
		}else{
			re+=odd[t];
		}
		cout<<re<<"\n";
		if(0){
			ll tmp=0;
			auto aa=a;
			while(aa.size()){
				tmp+=aa.back(); aa.pop_back();
				if(aa.empty()) break;
				ll mn=MOD,ii;
				rep(i,aa.size())if(MN(mn,abs(x-aa[i]))) ii=i;
				aa.erase(aa.begin()+ii);
			}
			out(tmp,re,1);
			assert(tmp==re);
		}
	}
  return 0;
}


Measured memory_bytes: 4864