#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18 + 10
#define INF (ll)1e9
#define MOD (ll)(998244353)
using namespace std;
template<class T1, class T2>
bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}
template<class T1, class T2>
bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}
template<class T1, class T2>
void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}
template<class T1, class T2>
void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}
template<class T>
void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
const int MAX = 2e5 + 10;
int N;
int b[MAX];
int prefix[MAX], suffix[MAX], ans[MAX];
pair<int, int> a[MAX];
void solve(){
cin >> N;
for(int i = 1; i <= N + 1; i++){
cin >> a[i].fi;
a[i].se = i;
}
for(int i = 1; i <= N; i++) cin >> b[i];
sort(a + 1, a + N + 2);
sort(b + 1, b + N + 1);
for(int i = 1; i <= N; i++){
prefix[i] = max(prefix[i - 1], max(0, a[i].fi - b[i]));
}
for(int i = N; i >= 1; i--){
suffix[i] = max(suffix[i + 1] , max(0, a[i + 1].fi - b[i]));
}
for(int i = 1; i <= N + 1; i++){
ans[a[i].se] = max(prefix[i - 1], suffix[i]);
}
for(int i = 1; i <= N + 1; i++) cout << ans[i] << ' ';
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("task.inp","r",stdin);
// freopen("task.out","w",stdout);
int T = 1;
// cin >> T;
for(; T; T--) solve();
return 0;
}
