#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pii;
const int N = 1e6 + 10;
int n, m, t[N];
int fa[N], sm[N], ans[N];
vector<pii> ev[N];
vector<int> que[N];
inline int Updiv(int x, int y) {
    return (x + y - 1) / y;
}
inline int Ask(int x) {
    return fa[x] >= 0 ? fa[x] = Ask(fa[x]) : x;
}

int A, B;  // current ans = A i + b
inline void Append(int x, int qu) {
    int rt = Ask(x);
    int si = -fa[rt];
    A += ((0 + si - 1) * si / 2) * qu;
    B += (si * t[rt - si + 1] - sm[rt]) * qu;
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    // n = 1e5; m = 1e5;
    for (int i = 1; i <= n; ++i) {
        cin >> t[i];
        // t[i] = 0;
        if (t[i] - t[i - 1] < N) ev[t[i] - t[i - 1]].push_back({i - 1, i});
    }
    t[n + 1] = 1e18;
    for (int i = 1, x; i <= m; ++i) {
        cin >> x;
        // x = i;
        que[x].push_back(i);
    }
    for (int i = 0; i <= n + 1; ++i) {
        fa[i] = -1;
        sm[i] = t[i];
    }
    for (int i = 0; i < N; ++i) {
        for (int p = 0; p < ev[i].size(); ++p) {
            auto [x, y] = ev[i][p];
            x = Ask(x); y = Ask(y);
            if (x == y) continue;
            Append(x, -1);
            Append(y, -1);
            fa[y] += fa[x];
            sm[y] += sm[x];
            fa[x] = y;
            Append(x, 1);
            int si = -fa[y];
            int nxt = Updiv(t[y + 1] - t[y - si + 1], si);
            assert(nxt >= i);
            if (nxt < N) ev[nxt].push_back({y, y + 1});
        }
        for (auto x : que[i]) {
            ans[x] = A * i + B;
        }
    }
    for (int i = 1; i <= m; ++i) cout << ans[i] << '\n';
    return 0;
}