#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;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_multiset;
#define ll long long
#define iloop(m, h) for (auto i = m; i != h; i += (m < h ? 1 : -1))
#define jloop(m, h) for (auto j = m; j != h; j += (m < h ? 1 : -1))
#define kloop(m, h) for (auto k = m; k != h; k += (m < h ? 1 : -1))
#define lloop(m, h) for (auto l = m; l != h; l += (m < h ? 1 : -1))
#define pll pair<ll, ll>
#define INF 1000000000000000
#define MOD1 1000000007
#define MOD2 998244353
#define MOD3 1000000009
ll n, m, a[200005], b[200005], cptr = 0, clo = 0, cma = 0, cmi = 0;
pll d[200005];
ll lh[200005], rh[200005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
iloop(0, n) cin >> a[i];
iloop(0, m) cin >> b[i];
iloop(0, n-1) d[i] = {a[i+1] - a[i], i};
sort(d, d+n-1);
iloop(0, m) {
clo += b[i];
cma = max(cma, clo);
cmi = min(cmi, clo);
while (cptr < n-1 && cma - cmi >= d[cptr].first) {
if (b[i] < 0) rh[d[cptr].second] = cma, lh[d[cptr].second+1] = cma - d[cptr].first;
else lh[d[cptr].second+1] = cmi, rh[d[cptr].second] = cmi + d[cptr].first;
cptr++;
}
}
while (cptr < n-1) {
lh[d[cptr].second+1] = cmi, rh[d[cptr].second] = cma;
cptr++;
}
rh[n-1] = cma, lh[0] = cmi;
iloop(0, n) cout << rh[i] - lh[i] << "\n";
}
