/*
VENI VIDI VICI
*/
// #pragma GCC optimize("Ofast","unroll-all-loops","fast-math","no-stack-protector","give-no-fuck")
#include <bits/stdc++.h>
// #include <iostream>
// #include <vector>
// #include <algorithm>
// #include <set>
// #include <map>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define rep(i,x, n) for (int i = (x); i < (n); ++i)
#define repr(i,x, n) for (int i = (n) - 1; i >= (x); --i)
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
// #define sum accumulate
//using i128 = __int128;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;
using sll = set<ll>;
template<class T>
istream& operator>>(istream& is, vector<T>& v) {
for(auto &i:v) is>>i;
return is;
}
template<class T1,class T2>
istream& operator>>(istream& is, pair<T1,T2>& p) {
is>>p.fi>>p.se;
return is;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
for(const auto &i:v) os<<i<<' ';
return os;
}
template<class T1,class T2>
ostream& operator<<(ostream& os, const pair<T1,T2>& p) {
os<<p.fi<<' '<<p.se; return os;
}
void pyn(bool x)
{
cout<<(x?"YES":"NO")<<endl;
}
void pYN(bool x)
{
cout<<(x?"Yes":"No")<<endl;
}
void pAB(bool x)
{
cout<<(x?"Alice":"Bob")<<endl;
}
ll powmod(ll a,ll b,ll modulo)
{
if(b==0){
return 1;
}
ll temp=powmod(a,b/2,modulo);
if(b%2==0){
return (temp*temp)%modulo;
}
else{
return (a*((temp*temp)%modulo))%modulo;
}
}
bool Prime(ll n){
for (ll i = 2; i*i <= n; i++)
if (n % i == 0)
return false;
return (n>1);
}
void readIO() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
void solve();
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// readIO();
int uwu=1;
// cin>>uwu;
for(int tc=1;tc<=uwu;tc++) {
// cout<<"Case #"<<tc<<": ";
solve();
}
return 0;
}
void solve()
{
// srand(time(0));
// ll cnt=0;
// while(cnt<1e5)
// {
// vl a;
// for(int j=0;j<4;j++)
// {
// a.pb(rand()%1000);
// }
// // cout<<a.size()<<endl;
// sort(begin(a),end(a));
// do
// {
// ll v1=max(min(a[1],a[3])-min(a[0],a[2]),max(a[1],a[3])-max(a[0],a[2]));
// ll v2=max(min(a[1],a[3])-max(a[0],a[2]),max(a[1],a[3])-min(a[0],a[2]));
// if(v2<v1)
// {
// cout<<"FUdge"<<endl;
// cout<<a[0]<<' '<<a[2]<<endl;
// cout<<a[1]<<' '<<a[3]<<endl;
// exit(0);
// break;
// }
// }while(next_permutation(all(a)));
// cnt++;
// }
// return;
ll n;
cin>>n;
vpi a(n+1);
// cin>>a;
for(int i=0;i<=n;i++)
{
cin>>a[i].fi;
a[i].se=i;
}
vl b(n);
cin>>b;
sort(all(a));
sort(all(b));
vl pre(n+2);
pre[0]=0;
for(int i=1;i<=n;i++)
{
pre[i]=max(pre[i-1],a[i-1].fi-b[i-1]);
}
vl suf(n+3);
suf[n+1]=0;
for(int i=n;i>=1;i--)
{
suf[i]=max(suf[i+1],a[i].fi-b[i-1]);
}
vl ans(n+1);
for(int i=1;i<=n+1;i++)
{
ans[a[i-1].se]=max(pre[i-1],suf[i]);
}
for(int i=0;i<=n;i++)cout<<ans[i]<<' ';
cout<<endl;
}
