//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define up upper_bound
#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
int n,q;
ll arr[200005];
ll brr[200005];
ii range[200005];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin.exceptions(ios::badbit | ios::failbit);
cin>>n>>q;
rep(x,0,n) cin>>arr[x];
rep(x,1,q+1) cin>>brr[x];
range[0]=ii(0,0);
ll curr=0;
rep(x,1,q+1){
curr+=brr[x];
range[x]=range[x-1];
range[x].fi=min(range[x].fi,curr);
range[x].se=max(range[x].se,curr);
}
rep(x,0,n){
ll l,r;
if (x==0) l=arr[x]+range[q].fi;
else{
int lo=0,hi=q,mi;
while (hi-lo>1){
mi=hi+lo>>1;
if (arr[x-1]+range[mi].se<=arr[x]+range[mi].fi) lo=mi;
else hi=mi;
}
if (brr[hi]<=0) l=max(arr[x-1]+range[hi].se,arr[x]+range[hi].fi);
else l=arr[x]+range[hi].fi;
}
if (x==n-1) r=arr[x]+range[q].se;
else{
int lo=0,hi=q,mi;
while (hi-lo>1){
mi=hi+lo>>1;
if (arr[x]+range[mi].se<=arr[x+1]+range[mi].fi) lo=mi;
else hi=mi;
}
//cout<<range[hi].se<<endl;
if (brr[hi]>=0) r=min(arr[x]+range[hi].se,arr[x+1]+range[hi].fi);
else r=arr[x]+range[hi].se;
}
//cout<<l<<" "<<r<<endl;
cout<<r-l<<endl;
}
}
