// Judges with GCC >= 12 only needs Ofast
#pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
#include <bits/stdc++.h>
using namespace std;
#define int ll
#define MAX LLONG_MAX
#define st first
#define nd second
#define endl '\n'
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(), x.end()
typedef long long ll;
typedef pair< int, int > ii;
typedef pair< int, ii > iii;
typedef vector< int > vi;
typedef vector< ii > vii;
typedef vector< iii > viii;
typedef vector< vi > vvi;
typedef vector< vii > vvii;
typedef vector< viii > vviii;
const int N = 2e5 + 5;
ii a[N];
int b[N], thang[N], cheo[N], ans[N];
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n; cin >> n;
for(int i=1; i<=n+1; i++){
cin >> a[i].st;
a[i].nd = 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+1; i++) thang[i] = max(thang[i-1], a[i].st - b[i]);
for(int i=n; i>=1; i--) cheo[i] = max(cheo[i+1], a[i+1].st - b[i]);
for(int i=1; i<=n+1; i++) ans[a[i].nd] = max(thang[i-1], cheo[i]);
for(int i=1; i<=n+1; i++) cout << ans[i] << ' ';
}
