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


#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1


#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}

#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}

typedef pair<li, li> PI;

li n;
li a[100200];

li sum[100200];
li sum2[100100];

inline bool check(li x, li len) {
    if (len > n)return false;
    li i_tmin = n - (len + 1) / 2;
    li i_amax = i_tmin - 1;
    li i_amin = n - len;
    if (abs(a[i_amax] - x) > abs(a[i_tmin] - x) || abs(a[i_amin] - x) > abs(a[i_tmin] - x)) {
        return false;
    }
    return true;
}

inline li solve(li x) {
    if (a[n - 2] <= x) {
        return sum2[n - 1];
    }
    li l = 0;
    li r = n + 1;
    // [n-x, n-1]の上半分を高橋、下半分を青木が取る、ができるか見る
    while (l + 1 < r) {
        li med = (l + r) / 2;
        if (check(x, med)) {
            l = med;
        } else {
            r = med;
        }
    }
    li res = 0;
    //p3(l, sum[n] - sum[n - (l + 1) / 2], sum2[n - l - 1]);
    res += sum[n] - sum[n - (l + 1) / 2];
    if (l < n) {
        if (l % 2 == 0) {
            res += sum2[n - l - 1];
        } else {
            res += (l < n - 1 ? sum2[n - l - 2] : 0);
        }
    }
    return res;
}

int main() {
    li q;
    cin >> n >> q;
    rin{
        cin >> a[i];
        sum[i + 1] = sum[i] + a[i];
        sum2[i] = a[i];
        if (i > 1) {
            sum2[i] += sum2[i - 2];
        }
    }

    rep(i, q) {
        li x;
        cin >> x;
        cout << solve(x) << endl;
    }

    return 0;
}

Measured memory_bytes: 4096