#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define int long long
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
#define sp <<' '<<
#define fi first
#define se second
#define pb push_back
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<bool> vb;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
#define all(x) x.begin(),x.end()
#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;
#define DEBUG(x) cout<<#x sp x<<endl;
#define carp(a,b) ((a%MOD)*(b%MOD))%MOD
#define topla(a,b) ((a%MOD)+(b%MOD))%MOD
#define mid (l+r)/2
const int MAXN=305;
const int MAXK=25;
const int MOD=1e9+7;
const int INF=1e18;
signed main(){
ios_base::sync_with_stdio(false);
//cin.tie(0);cout.tie(0);
int n;
cin>>n;
vi a(n+2), b(n+1);
vii vec;
FORE(i,1,n+2){
cin>>a[i];
vec.pb({a[i],i});
}
FORE(i,1,n+1) cin>>b[i];
vi res(n+2);
sort(all(vec));
sort(all(b));
multiset<int> s;
FORE(i,1,n+1){
s.insert(max(0LL,vec[i-1].fi-b[i]));
}
int tut;
for(int i=vec.size()-1;i>=0;i--){
//i.yi cikar
if(i<n){
s.erase(s.find(vec[i].fi-b[i+1]));
s.insert(tut-b[i+1]);
}
res[vec[i].se]=*s.rbegin();
tut=vec[i].fi;
}
FORE(i,1,n+2) cout<<res[i]<<' ';
cout<<endl;
}
