#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char>
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif
const ll inf = 1ll<<60;
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=1e6;
const double PI=acos(-1);
ll pw(ll x, ll p, ll m=mod){
ll ret=1;
while (p>0){
if (p&1){
ret*=x;
ret%=m;
}
x*=x;
x%=m;
p>>=1;
}
return ret;
}
ll inv(ll a, ll m=mod){
return pw(a,m-2);
}
//=======================================================================================
signed main (){
IOS();
int n, q; cin>>n>>q;
vector<int> vc(n), quer(q), ans(n);
vector<pii> cha;
REP(i,n){
cin>>vc[i];
if (i>0) cha.pb({vc[i]-vc[i-1], i});
}
int sm=0, msm=0;
int delt=0;
REP(i,q){
cin>>quer[i];
delt+=quer[i];
sm=min(sm, delt);
msm=max(msm, delt);
}
sm*=(-1);
sort(ALL(cha));
ans[0]+=sm;
ans[n-1]+=msm;
int curl=0, curr=0;
delt=0;
int ptr=0;
REP(i,q){
delt+=quer[i];
if (delt>0) curl=max(curl, delt);
else curr=max(curr, abs(delt));
while(ptr<n-1&&cha[ptr].f<=curl+curr){
int l=curl, r=curr;
if (delt>0){
l-=(curl+curr-cha[ptr].f);
}
else r-=(curl+curr-cha[ptr].f);
ans[cha[ptr].s]+=r;
ans[cha[ptr].s-1]+=l;
ptr++;
}
}
while(ptr<n-1){
ans[cha[ptr].s]+=curr;
ans[cha[ptr].s-1]+=curl;
ptr++;
}
REP(i,n){
cout<<ans[i]<<' ';
}
cout<<endl;
}
