#include <bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int n,b[N],mx_l[N],mx_r[N];
pair <int,int> a[N];
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(int i=1;i<=n+1;i++) cin >> a[i].first;
for(int i=1;i<=n+1;i++) a[i].second=i;
sort(a+1,a+1+n+1);
for(int i=1;i<=n;i++) cin >> b[i];
sort(b+1,b+1+n);
for(int i=1;i<=n;i++) mx_l[i]=max(mx_l[i-1],a[i].first-b[i]);
for(int i=n;i>=1;i--) mx_r[i]=max(mx_r[i+1],a[i+1].first-b[i]);
for(int i=1;i<=n+1;i++) cout << max(mx_l[i-1],mx_r[i]) << " ";
}
