#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> void Max(T &m, const T q) { if (m < q) m = q; }
template<typename T> void Min(T &m, const T q) { if (m > q) m = q; }
template<typename T1, typename T2> pair<T1, T2> operator+(pair<T1, T2> &l, pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(pair<T1, T2> &l, pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

int N, Q;
vector<lint> A, As, Asalt[2];

int main()
{
    cin >> N >> Q;
    A.resize(N);
    cin >> A;
    As.resize(N + 1);
    REP(i, N) As[i + 1] = As[i] + A[i];
    REP(d, 2) Asalt[d].resize(1);
    REP(i, N)
    {
        Asalt[i % 2].push_back(Asalt[i % 2].back() + A[i]);
    }

    REP(_, Q)
    {
        lint X;
        cin >> X;
        int pos = distance(A.begin(), lower_bound(A.begin(), A.end(), X));
        if (pos == 0)
        {
            printf("%lld\n", As[N] - As[N / 2]);
        }
        else if (pos == N)
        {
            if (N % 2) printf("%lld\n", Asalt[0][N / 2 + 1]);
            else printf("%lld\n", Asalt[1][N / 2]);
        }
        else
        {
            int l = 0, r = (N + 1) / 2 + 1;
            while (r - l > 1)
            {
                int c = (l + r) / 2;
                lint diff = A[N - c] - X;
                if (diff <= 0)
                {
                    r = c;
                    continue;
                }
                int n = distance(lower_bound(A.begin(), A.end(), X - diff), lower_bound(A.begin(), A.end(), X + diff));
                if (n >= c - 1) l = c;
                else r = c;
            }

            lint ans = As[N] - As[N - l];
            if (N % 2)
            {
                if (N - l * 2 >= 0) ans += Asalt[0][(N - l * 2) / 2 + 1];
            }
            else ans += Asalt[1][(N - l * 2) / 2];
            printf("%lld\n", ans);
        }
    }
}


Measured memory_bytes: 4340