#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

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

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

int main() {
  int N, Q;
  cin >> N >> Q;
  vector< int64 > A(N);
  cin >> A;

  vector< int64 > prefix{A};
  for(int i = 2; i < N; i++) {
    prefix[i] += prefix[i - 2];
  }
  vector< int64 > suffix{A};
  suffix.emplace_back(0);
  for(int i = N - 1; i >= 0; i--) {
    suffix[i] += suffix[i + 1];
  }


  while(Q--) {
    int64 X;
    cin >> X;

    auto check = [&](int sa) {
      int64 low = X - sa;
      int64 high = X + sa;
      low = lower_bound(begin(A), end(A), low) - begin(A);
      high = upper_bound(begin(A), end(A), high) - begin(A);
      return high - low <= N - high;
    };
    int ok = -1, ng = inf;
    while(ng - ok > 1) {
      int mid = (ok + ng) / 2;
      if(check(mid)) ok = mid;
      else ng = mid;
    }

    if(ok == -1) {
      cout << prefix[N - 1] << endl;
      continue;
    }

    int64 low = X - ok;
    int64 high = X + ok;
    low = lower_bound(begin(A), end(A), low) - begin(A);
    high = upper_bound(begin(A), end(A), high) - begin(A);
    int64 add = suffix[high];
    if(high - low + 2 == N - high) {
      if(low >= 3) add += prefix[low - 3];
    } else if(high - low + 1 == N - high) {
      if(low >= 2) add += prefix[low - 2];
    } else if(high - low == N - high) {
      if(low >= 1) add += prefix[low - 1];
    } else {
      assert(0);
    }
    cout << add << endl;
  }
}


Measured memory_bytes: 4080