/* 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];
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];
for(int i=0;i<q;i++) cin>>qq[i];
for(int i=1;i<=n;i++){
int lx = a[i-1], x = a[i] , rx = a[i+1];
pii lr = {lx, lx}, mr = {x, x}, rr = {rx, rx};
int l = -inf, r = -inf;
for(int j=0;j<q;j++){
if(qq[j] == 0) continue;
lx+=qq[j], x+=qq[j], rx+=qq[j];
umin(lr.ff, lx), umax(lr.ss, lx);
umin(mr.ff, x), umax(mr.ss, x);
umin(rr.ff, rx), umax(rr.ss, rx);
if(l == -inf && lr.ss >= mr.ff){
if(qq[j] > 0) l = mr.ff;
else l = lr.ss;
} if(r == -inf && rr.ff <= mr.ss){
if(qq[j] > 0) r = rr.ff;
else r = mr.ss;
}
}
if(l == -inf) l = mr.ff;
if(r == -inf) r = mr.ss;
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;
}
