#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=2e5+50;
const int mod=1e9+7;
using namespace std;
int n,i,b[nmax],mx,sf[nmax],rs[nmax];
pair<int,int>a[nmax];
int main()
{
//freopen("sol.in","r",stdin);
//freopen("sol.out","w",stdout);
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
cin>>n;
for(i=1;i<=n+1;i++)cin>>a[i].fr,a[i].sc=i;
for(i=1;i<=n;i++)cin>>b[i];
sort(a+1,a+n+2);
sort(b+1,b+n+1);
for(i=n+1;i>=1;i--)sf[i]=max(sf[i+1],max(a[i].fr-b[i-1],0));
for(i=1;i<=n+1;i++)
{
rs[a[i].sc]=max(mx,sf[i+1]);
mx=max(mx,max(a[i].fr-b[i],0));
}
for(i=1;i<=n+1;i++)cout<<rs[i]<<" ";
cout<<endl;
return 0;
}
