//記得跳題
#include<iostream>
#include<array>
#include<vector>
#include<string>
#include<algorithm>
#include<set>
#include<queue>
#include<stack>
#include<math.h>
#include<map>
#include<unordered_map>
#include<cstring>
#include<iomanip>
#include<bitset>
#include<tuple>
#define ll long long
#define LL __int128_t
#define DB double
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define INF (ll)(1e9)
#define MOD (ll)(1e9+7)
#define F first
#define S second
#define endl "\n"
#define AC ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
template<class T> using PQ=priority_queue<T,vector<T>,less<T> >;
void file(){
freopen("/Users/liaoyunyang/Desktop/meta_in.txt","r",stdin);
freopen("/Users/liaoyunyang/Desktop/meta_out.txt","w",stdout);
}
int a[200005],b[200005],init[200005],pre[200005],suf[200005];
map<int,int> ans;
signed main(){
AC;
int n; cin>>n;
FOR(i,1,n+2){
cin>>a[i]; init[i]=a[i];
}
FOR(i,1,n+1) cin>>b[i];
sort(a+1,a+n+2); sort(b+1,b+1+n);
FOR(i,1,n+1) pre[i]=max(pre[i-1],a[i]-b[i]);
REP(i,n,1) suf[i]=max(suf[i+1],a[i+1]-b[i]);
FOR(i,1,n+2){
if(!ans.count(a[i])) ans[a[i]]=max(pre[i-1],suf[i]);
else ans[a[i]]=min(ans[a[i]],max(pre[i-1],suf[i]));
}
FOR(i,1,n+2) cout<<ans[init[i]]<<" ";
}
/*
*/
