#include <bits/stdc++.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl

typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = 1e18;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair



int main() {
  fio();
  int n, q;
  cin >> n >> q;
  vl a(n);
  rep (i, n) {
    cin >> a[i];
  }
  vl sumr(n + 1);
  rrep (i, n) {
    sumr[i] = sumr[i + 1] + a[i];
  }
  vl sum0(n), sum1(n);
  sum0[0] = a[0];
  for (int i = 2; i < n; i += 2) {
    sum0[i] = sum0[i - 2] + a[i];
  }
  sum1[1] = a[1];
  for (int i = 3; i < n; i += 2) {
    sum1[i] = sum1[i - 2] + a[i];
  }
  while (q--) {
    ll x;
    cin >> x;
    auto itr = lower_bound(all(a), x);
    int ng = n, ok = 1;
    while (ok + 1 < ng) {
      int mid = (ng + ok) / 2;
      int ue = a[n - mid];
      int teki;
      if (ue <= x) {
        teki = 0;
      }
      else {
        int diff = ue - x;
        int sita = lower_bound(all(a), x - diff) - a.begin();
        teki = n - mid - sita;
      }
      if (teki + 2 <= mid) {
        ng = mid;
      }
      else {
        ok = mid;
      }
    }
    int mid = ok;
    ll ue = a[n - mid];
    int teki;
    if (ue <= x) {
      teki = 0;
    }
    else {
      ll diff = ue - x;
      int sita = lower_bound(all(a), x - diff) - a.begin();
      teki = n - mid - sita;
    }
    ll ans = sumr[n - ok];
    if (n - 2*ok > 0) {
      if ((n - 2*ok) % 2 == 0) {
        ans += sum1[n - 2*ok - 1];
      }
      else {
        ans += sum0[n - 2*ok - 1];
      }
    }
    cout << ans << endl;
  }
}
        
 


Measured memory_bytes: 4864