//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T>
using Tree =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define per(i, b, a) for (int i = b; i >= a; --i)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define lsb(x) (x)&(-x)
#define bug(x) cerr << #x << " " << x << endl;
void setIO(string name = "") {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
if (!name.empty()) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
}
ll fexp(ll a, ll b, ll m) {
if (b == 0) return 1LL;
ll p = a;
ll ans = 1;
while (b > 0) {
if (b % 2 != 0) ans = (ans * p) % m;
p = (p * p) % m;
b >>= 1;
}
return ans;
}
const int MAXN = 2e5 + 10;
const int INF = 1e18 + 5;
const int MOD = 1e9+7;
int a[MAXN], ml[MAXN], mr[MAXN], ans[MAXN], op[MAXN];
void solve() {
int n,q;cin >> n >> q;
rep(i,1,n) cin >> a[i];
int cur = 0;
rep(i,1,q) {
cin >> op[i];
cur+=op[i];
ml[i]=max(ml[i-1],-cur);
mr[i]=max(mr[i-1],cur);
}
rep(i,2,n) {
int lo = 0, hi = q, anss;
while (lo<=hi) {
int mid = (lo+hi)/2;
if (a[i]-a[i-1]<=ml[mid]+mr[mid]) {
hi = mid-1;
} else {
lo = mid + 1;
anss =mid;
}
}
int k = a[i]-a[i-1];
k-=ml[anss]+mr[anss];
ans[i-1] += mr[anss];
ans[i] += ml[anss];
if (op[anss+1]>0) ans[i-1] += k;
else if (op[anss+1]<0) ans[i] += k;
}
ans[1] += ml[q];
ans[n] += mr[q];
rep(i,1,n) cout << ans[i] << '\n';
}
int32_t main() {
setIO();
int tt = 1;
//cin >> tt;
while (tt-- > 0) solve();
return 0;
}
