#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define int ll
#define all(x) (x).begin(), (x).end()
#define md ((tl + tr) >> 1)
#define TL v + v, tl, md
#define TR v + v + 1, md + 1, tr
#define F first
#define S second
#define pii pair<int, int>
const int maxn = 5e5 + 7;
const int maxw = 1e6 + 7;
const ll inf = 1e18 + 7;
const double PI = atan2(0.0, -1.0);
int n, q, x[maxn], w[maxn], pos[maxn], neg[maxn], d[maxn], ans[maxn];
void solve() {
cin >> n >> q;
for (int i = 1; i <= n; i++)
cin >> x[i];
x[0] = -inf, x[n + 1] = inf;
for (int i = 1; i <= q; i++)
cin >> w[i];
cout << '\n';
for (int i = 1; i <= q; i++) {
d[i] = d[i - 1] + w[i];
pos[i] = max(pos[i - 1], d[i]);
neg[i] = max(neg[i - 1], -d[i]);
}
for (int i = 1; i <= n + 1; i++) {
if (x[i - 1] + pos[q] <= x[i] - neg[q])
ans[i] += neg[q], ans[i - 1] += pos[q];
else {
int l = 0, r = q + 1;
while (l + 1 < r) {
int mid = l + r >> 1;
if (x[i - 1] + pos[mid] <= x[i] - neg[mid])
l = mid;
else
r = mid;
}
int p = x[i] - neg[l];
if (w[r] < 0)
p = x[i - 1] + pos[l];
ans[i] += x[i] - p, ans[i - 1] += p - x[i - 1];
}
}
for (int i = 1; i <= n; i++)
cout << ans[i] << '\n';
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int test = 1;
// cin >> test;
while (test--) {
solve();
// cout << '\n';
}
return 0;
}
