#include <bits/stdc++.h>
using namespace std;
#include <bits/extc++.h>
using namespace __gnu_pbds;
#include <ext/rope>
using namespace __gnu_cxx;
typedef tree<long long, null_type, less<long long>,
rb_tree_tag, tree_order_statistics_node_update> pbds;
//less_equal for identical elements
#define DEBUG
#ifdef DEBUG
#define debug(...) printf(__VA_ARGS__);
#else
#define debug(...)
#endif
#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb emplace_back
#define sz(x) (int)x.size()
#define mnto(x,y) x=min(x,(__typeof__(x))y)
#define mxto(x,y) x=max(x,(__typeof__(x))y)
#define INF 1023456789
#define LINF 1023456789123456789
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vll;
mt19937 rng(time(0));
#define maxn 200005
int n,q;
ll x[maxn],w[maxn],p[maxn],mx[maxn],mn[maxn],t[maxn];
int main(){
sf("%d%d",&n,&q);
for(int i=0;i<n;++i){
sf("%lld",&x[i]);
}
for(int i=1;i<=q;++i){
sf("%lld",&w[i]);
p[i]=p[i-1]+w[i];
mx[i]=max(mx[i-1],p[i]);
mn[i]=min(mn[i-1],p[i]);
}
for(int i=0;i<n;++i){
if(i!=0&&x[i-1]+mx[q]>x[i]+mn[q]){
int lo=0,hi=q,mid,res=q;
while(lo<=hi){
mid=(lo+hi)/2;
if(x[i-1]+mx[mid]<=x[i]+mn[mid])lo=mid+1;
else res=mid,hi=mid-1;
}
if(mn[res]==mn[res-1])t[i]+=-mn[res];
else t[i]+=x[i]-(x[i-1]+mx[res]);
}
else t[i]+=-mn[q];
if(i!=n-1&&x[i]+mx[q]>x[i+1]+mn[q]){
int lo=0,hi=q,mid,res=q;
while(lo<=hi){
mid=(lo+hi)/2;
if(x[i]+mx[mid]<=x[i+1]+mn[mid])lo=mid+1;
else res=mid,hi=mid-1;
}
if(mx[res]==mx[res-1])t[i]+=mx[res];
else t[i]+=x[i+1]+mn[res]-x[i];
}
else t[i]+=mx[q];
}
for(int i=0;i<n;++i){
pf("%lld\n",t[i]);
}
}
