#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair

template<class T> inline void amin(T & a, T const & b) { a = min(a, b); }
template<class T> inline void amax(T & a, T const & b) { a = max(a, b); }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }


ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == 0) {
        v.clear();
        return 0;
    }
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}



int N, Q;
vi a;
vll acc, racc;
unordered_map<int,int> am;

int ca1=0, ca2=0, ca3=0;

void prepare(){
    rep(i,N){
        am[ a[i] ] = i;
    }

    acc.resize(N+1);
    racc.resize(N+1);
    acc[0] = 0;
    rep(i,N) acc[i+1] = acc[i] + a[i];
    racc[0] = 0;
    if (N % 2) {
        for (int i=0,j=0; i<N; i+=2,j++) {
            racc[j+1] = racc[j] + a[i];
        }
    } else {
        for (int i=1,j=0; i<N; i+=2,j++) {
            racc[j+1] = racc[j] + a[i];
        }
    }
}


inline ll f(int n){
    ++ca1;
    int r = (N - 2*n), h = (r+1)/2;
    ll pre = acc[N] - acc[N-n];
    if (h > 0)
        pre += racc[h] - racc[0];
    return pre;
}


bool nth_available(int x, int n){
    assert(IN(n,1,N));
    int t_nth_at = a[N-n];
    if (x >= t_nth_at) return false;
    assert(x < t_nth_at);
    int d = t_nth_at - x;
    int opp = x - d, opp_ix;
    if (found(am, opp)) {
        opp_ix = am[opp];
    } else {
        opp_ix = upper_bound(ALL(a), opp) - a.begin();
    }
    int a_rank = (N-n) - opp_ix + 1;
    bool res = (a_rank >= n);
    return res;
}

inline int find_n(int x) {
    if (x >= a[N-1]) return 0;
    int h = (N+1)/2;
    if (x <= a[0]) return h;

    int ok=1, ng=N;
    int a_lo, a_hi;
    while (abs(ok-ng) > 1) {
        int n = mid(ng, ok);
        if (nth_available(x, n)) {
            ok = n;
        } else {
            ng = n;
        }
    }
    return ok;
}

int main() {
    scanf("%d%d", &N, &Q); read_cr();
    a.resize(N);
    loadvec(a, N);
    prepare();

    rep(i,Q) {
        int xi;
        scanf("%d", &xi);

        int n = find_n(xi);
        ll ans = f(n);
        printf("%lld\n", ans);
    }

    return 0;
}


Measured memory_bytes: 8740