#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll MOD=1e9+7;
const ll N=1e6+4;
const ld pi=3.14159265359;
const ll INF=(1LL<<60);
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(a) (ll)a.size()
ll n,x,a[N],u[N];
vector<pll> v;
multiset<ll,greater<ll> > ans;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n;
REP1(i,n+1){cin>>x;v.pb(mp(x,i));}
sort(v.begin(),v.end());
REP1(i,n)cin>>u[i];
sort(u+1,u+n+1);
REP1(i,n){ans.insert(max(0LL,v[i].X-u[i]));}
a[v[0].Y]=*ans.begin();
REP1(i,n){
ans.erase(ans.find(max(0LL,v[i].X-u[i])));
ans.insert(max(0LL,v[i-1].X-u[i]));
a[v[i].Y]=*ans.begin();
}
REP1(i,n+1)cout<<a[i]<<(i==n+1?"\n":" ");
return 0;
}
