#include <bits/stdc++.h>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef complex<double> base;
typedef complex<int> point;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

#define watch(x) cerr << (#x) << " = " << (x)    << endl

const double PI = 2 * acos(0.0);

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";

template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}



void smain();

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(12) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
}

const int N = 1e5 + 9;
int n, q;
ll a[N];

ll pref[N], pref2[N];

ll get_pref(int l, int r) {
    if (!l--) return pref[r];
    return pref[r] - pref[l];
}

bool check(int bound, ll x, int pos) {
    int cnt = n - bound;
    int cnt2 = bound - pos;
    int cnt3 = cnt - cnt2;
    if (cnt3 < 0) return false;

    int lf = pos - cnt3 - 1;
    int rf = bound - 1;
    if (min(lf, rf) < 0) return true;
    return x - a[lf] > a[rf] - x;
}

void smain() {

    cin >> n >> q;
    fori (i, n) cin >> a[i];

    pref[0] = a[0];
    for (int i = 1; i < n; ++i) pref[i] = pref[i - 1] + a[i];

    pref2[0] = a[0];
    pref2[1] = a[1];

    for (int i = 2; i < n; ++i) pref2[i] = pref2[i - 2] + a[i];

    fori (iter, q) {
        ll x;
        cin >> x;
        int pos = lower_bound(a, a + n, x) - a;
        if (pos == n) {
            cout << pref2[n - 1] << '\n';
            continue;
        }
#ifdef MAX_HOME
    check(5, x, pos);
#endif
        int l = pos, r = n;
        while (r > l + 1) {
            int mid = r + l >> 1;
            (check(mid, x, pos) ? l : r) = mid;
        }
        ll ans = get_pref(l, n - 1);
        int cnt = n - l;
        if (l - cnt - 1 >= 0) ans += pref2[l - cnt - 1];
        cout << ans << '\n';
    }

}

Measured memory_bytes: 4096