#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <numeric>
#include <functional>
#include <iomanip>
#include <sstream>
#include <numeric>
#define endl "\n"
#define int long long
#define pb push_back
#define fi first
#define se second
#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//pragma GCC optimize("unroll-loops")
using namespace std;
int INF=1e18;
int MOD=1e9+7;
int MOD2=1e9;
int ABCMOD=998244353;
//mac olunca template kullanmak zorundayim :/
inline void solve(){
int n; cin>>n;
vector<int> b(n);
vector<pair<int,int>> a(n+1);
for(int i=0;i<=n;i++) {
cin>>a[i].fi;
a[i].se=i;
}
for(int i=0;i<n;i++) cin>>b[i];
sort(a.begin(),a.end());
sort(b.begin(),b.end());
vector<int> norm(n), left(n);
vector<int> lsufmax(n,-INF);
vector<int> nprefmax(n,-INF);
for(int i=0;i<n;i++){
norm[i]=a[i].fi-b[i];
left[i]=a[i+1].fi-b[i];
nprefmax[i]=max(nprefmax[i],norm[i]);
if(i>0) nprefmax[i]=max(nprefmax[i-1],norm[i]);
}
for(int i=n-1;i>=0;i--){
lsufmax[i]=max(lsufmax[i],left[i]);
if(i<n-1) lsufmax[i]=max(lsufmax[i+1],left[i]);
}
/*
for(int i=0;i<n;i++) cout<<norm[i]<<" ";
cout<<endl;
for(int i=0;i<n;i++) cout<<left[i]<<" ";
cout<<endl;
for(int i=0;i<n;i++) cout<<nprefmax[i]<<" ";
cout<<endl;
for(int i=0;i<n;i++) cout<<lsufmax[i]<<" ";
cout<<endl;
*/
vector<int> ans(n+1);
for(int i=0;i<=n;i++){
int cvp=-INF;
if(i>0) cvp=max(cvp,nprefmax[i-1]);
if(i<n) cvp=max(cvp,lsufmax[i]);
ans[a[i].se]=cvp;
}
for(int i: ans) cout<<i<<" ";
}
signed main(){
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
//freopen("hps.in", "r", stdin); freopen("hps.out", "w", stdout);
int T=1; //cin>>T;
while (T--){
solve();
}
}
