#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
int N, Q, minl, maxr, curr, X[200005], L[200005], R[200005];
bool fL[200005], fR[200005];
priority_queue<ii, vector<ii>, greater<ii> > pq;
main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N >> Q;
for (int i = 1; i <= N; i++) {
cin >> X[i];
if (i > 1) pq.emplace(X[i] - X[i - 1], i);
}
for (int i = 1, W; i <= Q; i++) {
cin >> W;
curr += W;
minl = min(minl, curr);
maxr = max(maxr, curr);
while (!pq.empty() && pq.top().first <= maxr - minl) {
int y = pq.top().second;
if (W > 0) {
fR[y - 1] = fL[y] = 1;
R[y - 1] = L[y] = X[y] + minl;
} else {
assert(W != 0);
fR[y - 1] = fL[y] = 1;
R[y - 1] = L[y] = X[y - 1] + maxr;
}
pq.pop();
}
}
for (int i = 1; i <= N; i++) {
if (!fL[i]) L[i] = X[i] + minl;
if (!fR[i]) R[i] = X[i] + maxr;
cout << R[i] - L[i] << '\n';
}
}
