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

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define FOR(i, to) for (int i = 0; i < (to); ++i)
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<pair<int, int> > vpi;
typedef pair<ll,ll> pll;
typedef vector<string> vs;
const char en = '\n';
vi v;
int N,Q;
int X;
vi POS;
vi getPos(int x) {
  int last = sz(v)-1;
  vi ret(sz(v));
  for (int i=0;i<sz(v);++i) {
    while(last >= 0 && v[last] + v[i] > x) {
      --last;
    }
    ret[i] = last + i;
  }

  return ret;
}

int canExtend(int l, int r, deque<pii> &dq) {
  if (r+1 == l) {
    return v[l] <= X;
  }
  if (r == sz(v)-1) return 0;
  if ((r-l+1) % 2 == 0) {
    return v[r+1] <= X;
  }
  // l gets matched with r + 1
  int mid = (l + r) / 2;
  //cout << mid << endl;
  //cout << sz(dq) << endl;
  //cout << l << " " << r << " " << sz(dq) << " " << POS[mid] << " " << (r+1 + l) << endl;
  if (sz(dq)) {
    //cout << dq.front().fs << " " << dq.front().sc << endl;
  }
  // POS[l] >= r+1 - l
  //
  if ( (sz(dq) == 0 || dq.front().fs >= (r + 1 + l)) && POS[mid] >= (r+1 + l)) {
    //cout << "!" << endl;
    return 1;
  }
  return 0;
}

ll make(ll val) {
  POS = getPos(val);
  int right = 0;
  deque<pii> dq;
  ll curSum = v[0];
  ll ret = 0;
  for (int i=0;i<sz(v);++i) {
    if (i) curSum -= v[i-1];
    if (dq.front().sc < i) {
      dq.pop_front();
    }
    if ( (right - i+1)%2 == 0) {
      curSum -= v[right];
      --right;
    }
    //cout << i << " " << right << "START" << endl;
    while (canExtend(i, right, dq)) {
      ++right;
      curSum += v[right];
      if ( (right-i + 1) % 2 == 0) {
        int newVal = (i + right) / 2;
        while(sz(dq) != 0 && dq.back().fs >= POS[newVal]) {
          dq.pop_back();
        }
        dq.push_back({POS[newVal], newVal});
      }
    }
    if (right < i) break;
    // i, right is good
    ret += curSum - v[i] * (right - i + 1);
    //cout << i << " FINAL " << right << endl;
  }
  return ret;
}

int main() {
  cin >> N >> Q;
  FOR(i, N) {
    int x;
    cin >> x;
    v.pb(x);
  }
  FOR(i, Q) {
    int q; cin >> q;
    X = q;
    cout << make(q) << "\n";
  }
}