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

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<vector<int> > mati;
typedef vector<vector<double> > matd;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)

inline void IN(void){
  return;
}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
  cin >> first;
  IN(rest...);
  return;
}

inline void OUT(void){
  cout << "\n";
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest){
  cout << first << " ";
  OUT(rest...);
  return;
}

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cout << VEC[i] << " ";
  }
  cout << "\n";
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i, MAT.size()){
    REP(j, MAT[i].size()){
      cout << MAT[i][j] << " ";
    }
    cout << "\n";
  }
};

template <typename CLASS1, typename CLASS2>
class HOGE{
  public:
    CLASS1 key;
    CLASS2 value;
    HOGE(void){
      return;
    };
    HOGE(CLASS1 key, CLASS2 value){
      this->key = key;
      this->value = value;
    };
    ~HOGE(void){
      return;
    };

    void print(void){
      cout << "key : " << key << ", value : " << value << "\n";
      return;
    };
    
    bool operator==(const HOGE &obj){
      return (this->value == obj.value);
    };
    bool operator<(const HOGE &obj){
      return (this->value < obj.value);
    };
    bool operator>(const HOGE &obj){
      return (this->value > obj.value);
    };
};

template <typename CLASS1, typename CLASS2>
bool operator==(const HOGE<CLASS1, CLASS2> &hoge1, const HOGE<CLASS1, CLASS2> &hoge2){
  return hoge1.value == hoge2.value;
};

template <typename CLASS1, typename CLASS2>
bool operator<(const HOGE<CLASS1, CLASS2> &hoge1, const HOGE<CLASS1, CLASS2> &hoge2){
  return hoge1.value < hoge2.value;
};

template <typename CLASS1, typename CLASS2>
bool operator>(const HOGE<CLASS1, CLASS2> &hoge1, const HOGE<CLASS1, CLASS2> &hoge2){
  return hoge1.value > hoge2.value;
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  ll N, Q;
  IN(N, Q);
  vll A(N);
  REP(i, N) IN(A[i]);
  vll X(Q);
  REP(i, Q) IN(X[i]);

  sort(A.begin(), A.end());

  ll noc = (N+1)/2;
  vll sum1(noc), sum2(noc);

  sum1[0] = A[A.size()-1];
  FOR(i, 1, noc){
    sum1[i] = sum1[i-1] + A[N-1-i];
  }
  sum2[0] = A[(N+1)%2];
  FOR(i, 1, noc){
    sum2[i] = sum2[i-1] + A[2*i+(N+1)%2];
  }

  vll B;
  ll j_begin = 2;
  ll j_end = 3;
  while(N-j_end>=0){
    B.push_back((A[N-j_begin]+A[N-j_end])/2);
    j_begin++;
    j_end+=2;
  }

  sort(B.begin(), B.end());

  REP(i, Q){
    if(X[i]<=(A[0]+A[N/2])/2){
      cout << sum1[noc-1] << "\n";
      continue;
    }
    if(X[i]>(A[N-2]+A[N-3])/2){
      cout << sum2[noc-1] << "\n";
      continue;
    }

    auto itr = lower_bound(B.begin(), B.end(), X[i]);
    ll pos = (ll)(itr - B.begin());

    if(pos>=noc){
      cout << sum2[noc-1] << "\n";
    }else if(pos<=0){
      cout << sum1[noc-1] << "\n";
    }else{
      cout << sum1[noc-1-pos] + sum2[pos-1] << "\n";
    }
  }

  return 0;
}

Measured memory_bytes: 4600