//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 30;
const int mod = 998244353;
void solve(){
int n, m; cin >> n >> m;
vector<int>a(n+1);
for (int i = 1; i<=n; i++) cin >> a[i];
vector<int>ans(n+1);
vector<int>w(m+1), mn(m+1), mx(m+1), pref(m+1);
for (int i = 1; i<=m; i++){
cin >> w[i];
pref[i] = pref[i-1] + w[i];
mn[i] = min(pref[i], mn[i-1]);
mx[i] = max(pref[i], mx[i-1]);
}
ans[1] -= mn.back();
ans[n] += mx.back();
debug(mn, mx);
for (int i = 1; i<n; i++){
int l = 0, r = m;
int curr = 0;
while (r >= l){
int mid = (l+r)/2;
if (mx[mid] + a[i] >= mn[mid] + a[i+1]){
r = mid-1;
} else {
curr = mid;
l = mid+1;
}
}
//curr -- ostatni taki indeks
if (curr == m){
ans[i] += max(0ll, mx.back());
ans[i+1] += max(0ll, -mn.back());
} else {
int d = a[i+1]-a[i];
// debug(i, curr, mn[curr], mx[curr], w[curr+1]);
if (w[curr+1] < 0){
int tt = min(d, max(0ll, mx[curr]));
ans[i] += tt;
debug(tt, d-tt);
ans[i+1] += d-tt;
} else {
int tt = min(d, max(0ll, -mn[curr]));
ans[i+1] += tt;
ans[i] += d-tt;
debug(d-tt, tt);
}
debug(ans[i]);
}
}
for (int i = 1; i<=n; i++) cout << ans[i] << "\n";
}
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
//cin >> t;
while (t--) solve();
return 0;
}
