/* made by amunduzbaev */
//~ #include <ext/pb_ds/assoc_container.hpp>
//~ #include <ext/pb_ds/tree_policy.hpp>
#include "bits/stdc++.h"
using namespace std;
//~ using namespace __gnu_pbds;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vv vector
#define mem(arr, v) memset(arr, v, sizeof arr)
#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vii;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) { return a > b ? a = b, true : false; }
template<class T> bool umax(T& a, const T& b) { return a < b ? a = b, true : false; }
template<int sz> using tut = array<int, sz>;
void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
//~ template<class T> using oset = tree<T,
//~ null_type, less_equal<T>, rb_tree_tag,
//~ tree_order_statistics_node_update> ordered_set;
const int N = 2e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
#define MULTI 0
int n, m, k, s, t, q, ans, res, a[N];
int qq[N], mn[N], mx[N];
pii rng(int i, int r) { return mp(a[i] + mn[r], a[i] + mx[r]); }
void solve(int t_case){
cin>>n>>q;
a[0] = -inf, a[n+1] = inf;
for(int i=1;i<=n;i++) cin>>a[i];
int tt = 0;
for(int i=0;i<q;i++){
cin>>qq[i], tt += qq[i];
umin(mn[i], tt), umax(mx[i], tt);
if(i) umin(mn[i], mn[i-1]), umax(mx[i], mx[i-1]);
}
//~ for(int i=0;i<q;i++) cout<<mn[i]<<" "<<mx[i]<<"\n";
for(int i=1;i<=n;i++){
int l = 0, r = q-1;
int L, R;
if(rng(i-1, r).ss >= rng(i, r).ff){
while(l < r){
int m = (l + r)>>1;
pii mx = rng(i, m), lx = rng(i - 1, m);
if(lx.ss >= mx.ff) r = m;
else l = m + 1;
} pii lx = rng(i-1, l), m = rng(i, l);
if(qq[l] > 0) L = m.ff;
else L = lx.ss;
} else L = rng(i, r).ff;
l = 0, r = q-1;
if(rng(i, r).ss >= rng(i+1, r).ff){
while(l < r){
int m = (l + r)>>1;
pii mx = rng(i, m), rx = rng(i + 1, m);
if(mx.ss >= rx.ff) r = m;
else l = m + 1;
} pii m = rng(i, l), rx = rng(i+1, l);
//~ cout<<l<<" ";
if(qq[l] < 0) R = m.ss;
else R = rx.ff;
} else R = rng(i, r).ss;
//~ cout<<L<<" "<<R<<"\n";
cout<<R - L<<"\n";
}
}
signed main(){
NeedForSpeed
if(MULTI){
int t; cin>>t;
for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
} else solve(1);
return 0;
}
