#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;

typedef long long ll;
//typedef pair<int,int> Pint;
//typedef pair<ll, ll> P;
//typedef pair<ll, pair<ll, ll>> P;
//typedef tuple<int,int,int> T;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define revrep(i, n) for(ll i = n-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
const ll INFL = 1LL << 60;//10^18 = 2^60
const int INF = 1 << 30;//10^9
const ll MOD = 1e9 + 7;
//ll MOD  = 998244353;
vector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};


ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x;
    k /= 2;
  }
  return res;
}

ll pow_mod(ll x, ll k){
  x %= MOD; x += MOD; x %= MOD;
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}
ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){return x / gcd(x, y) * y;};


int main(void){
  ll N, Q;
  cin >> N >> Q;
  vector<ll> A(N);
  rep(i, N) cin >> A[i];
  vector<ll> S(N+1, 0);
  vector<ll> evenS(N+1, 0);
  rep(i, N) S[i+1] = S[i] + A[i];
  rep(i, N){
    if(i % 2){
      evenS[i+1] = evenS[i] + A[i];
    }else{
      evenS[i+1] = evenS[i];
    }
  }
  ll sum = 0;
  rep(i, N) sum += A[i];

  if(N % 2){
    rep(i, N){
      if(i % 2){
        evenS[i+1] = evenS[i] + A[i];
      }else{
        evenS[i+1] = evenS[i];
      }
    }
    vector<ll> canGet(N/2+1);
    //x <= canGet[i] の時 i個以上連続
    canGet[0] = -((A[N-3] + A[N-2]) / 2 + 1);
    canGet[1] = -((A[N-3] + A[N-2]) / 2 + 1);
    for(int i = 2; i <= N / 2; i++){
      canGet[i] = -(A[N-i*2-1] + A[N-i-1]) / 2;
    }
    rep(i, Q){
      ll x;
      cin >> x;
      x = -x;
      if(x >= canGet.back()){
        cout << sum - S[N/2] << endl;
        continue;
      }
      if(x <= canGet[1]){
        cout << sum - evenS[N] << endl;
        continue;
      }
      ll AOKI = 0;
      ll soeji = upper_bound(canGet.begin(), canGet.end(), x) - canGet.begin();
      AOKI += S[N-soeji] - S[N-soeji * 2];
      AOKI += evenS[N-soeji * 2];
      cout << sum - AOKI << endl;
    }
  }else{
    rep(i, N){
      if(i % 2){
        evenS[i+1] = evenS[i];
      }else{
        evenS[i+1] = evenS[i] + A[i];
      }
    }
    vector<ll> canGet(N/2+1);
    //x <= canGet[i] の時 i個以上連続
    canGet[0] = -((A[N-3] + A[N-2]) / 2 + 1);
    canGet[1] = -((A[N-3] + A[N-2]) / 2 + 1);
    for(int i = 2; i < N / 2; i++){
      canGet[i] = -(A[N-i*2-1] + A[N-i-1]) / 2;
    }
    canGet[N / 2] = 0;
    rep(i, Q){
      ll x;
      cin >> x;
      x = -x;
      if(x <= canGet[1]){
        cout << sum - evenS[N] << endl;
        continue;
      }
      if(x >= canGet.back()){
        cout << sum - S[N/2] << endl;
        continue;
      }
      ll AOKI = 0;
      ll soeji = upper_bound(canGet.begin(), canGet.end(), x) - canGet.begin();
      AOKI += S[N-soeji] - S[N-soeji * 2];
      AOKI += evenS[N-soeji * 2];
      cout << sum - AOKI << endl;
    }
  }
}


Measured memory_bytes: 4480