//#include <bits/stdc++.h>

#include <iostream>
#include <algorithm>

#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstring>
#include <string>
#include <utility>
#include <array>
#include <complex>
#include <valarray>

#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>

#include<memory>


using namespace std;
#define int long long

typedef long long ll;
typedef unsigned long long ull;
//typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double,int> pdi;
typedef pair<long double, int> pdbi;
typedef pair<int,pii> pipii;
typedef pair<ll,pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()

template <class T>
using MINPQ = std::priority_queue<T, vector<T>, greater<T>>; //MINPQ<pii> pq;
template <class T>
using MAXPQ = std::priority_queue<T>;


const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1<<30;
const ll INFLL = 1LL<<62;
const long double EPS = 1e-12;
const ll mod = 1000000000 + 7;
//const ll mod = 998244353;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const long double pi = 3.141592653589793;

#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod
#define inside(y, x, h, w) (0 <= (y) && (y) < (h) && 0 <= (x) && (x) < (w)) ? true : false
#define stand(B, i) (((B>>i) & 1) == 1) ? true : false //Bのi番目のbitが1ならtrue, 0ならfalse

//debug
#define DEBUG

#define DUMPOUT cerr

#ifdef DEBUG
#define dump(...) DUMPOUT<<#__VA_ARGS__<<" :["<<__FUNCTION__<<":"<<__LINE__<<"]"<<endl; DUMPOUT<<"    "; dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif

void dump_func() {DUMPOUT << endl;};

template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) == 0) DUMPOUT << " ";
    else DUMPOUT << ", ";
    dump_func(std::move(tail)...);
}

//ostream
template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {
    os << "["; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "]";
    return os;
}

template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& map_var) {
    os << "[";
    for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
        os << "(" << itr->first << ", " << itr->second << ")"; itr++;  if(itr != map_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}

template<typename T> ostream& operator << (ostream& os, set<T>& set_var) {
    os << "[";
    for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr; ++itr; if(itr != set_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}

int n, q;
vector<int> A;

signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> q;
  A.resize(n);
  rep(i, n) cin >> A[i];
  int sum[n] = {};
  int sum1[n] = {};
  sum[0] = A[0];
  sum1[0] = A[0];
  sum1[1] = A[1];
  rep2(i, 1, n) {
    sum[i] = sum[i-1] + A[i];
  }
  for (int i = 2; i < n; i+=2) {
    sum1[i] += sum1[i-2] + A[i];
  }
  for (int i = 3; i < n; i+=2) {
    sum1[i] += sum1[i-2] + A[i];
  }
  rep(i, q) {
    int x;
    cin >> x;
    int l = -1;
    int r = n;
    int player = 0; //0:takahashi, 1:aoki
    int st = -1;
    if (x >= A[n-1]) {
      cout << sum1[n-1] << endl;
      continue;
    }
    while (r-l>1) {
      int m = (r+l)/2;
      //cerr << l << " " << r << " " << m << endl;
      if (A[m] <= x) {
        l = m;
        continue;
      }
      int r_lw = abs(x - A[m-1]);
      int r_up  = abs(x - A[m]);
      if (r_lw > r_up) {
        if (0 == n-m-1) {
          r = m;
          player = 1;
          st = m-1;
          break;
        }
        l = m;
        continue;
      }
      int idx0 = lower_bound(all(A), x - r_lw) - A.begin();
      int idx1 = lower_bound(all(A), x - r_up) - A.begin();
      int cnt0 = m - idx0;
      int cnt1 = m - idx1;
      if (cnt0 > n-m) {
        r = m;
        continue;
      }
      if (cnt1 < n-m-1) {
        l = m;
        continue;
      }
      if (cnt1 == n-m-1) {
        r = m;
        int nokori = n-m-1 - cnt0;
        st = idx0 - nokori - 1;
        player = 1;
        break;
      }
      if (cnt1 >= n-m) {
        r = m;
        int nokori = n-m - cnt0;
        st = idx0 - nokori - 1;
        player = 0;
        break;
      }
    }
    //cerr << r << " " << player << " " << st << endl;
    int ans = sum[n-1] - sum[r] + A[r];
    if (player == 0 && st >= 0) ans += sum1[st];
    else {
      if (st >= 1) ans += sum1[st-1];
    }
    cout << ans << endl;
  }
}


Measured memory_bytes: 4096