#include <bits/stdc++.h>
using namespace std;
const int nx=2e5+5;
int n, b[nx], l[nx], r[nx], mx, ans[nx];
vector<pair<int, int>> a(nx);
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n;
for (int i=1; i<=n+1; i++) cin>>a[i].first, a[i].second=i;
for (int i=1; i<=n; i++) cin>>b[i];
b[n+1]=1e9;
sort(b+1, b+n+1);
sort(a.begin()+1, a.begin()+n+2);
for (int i=1; i<=n+1; i++) l[i]=max(l[i-1], a[i].first-b[i]);
for (int i=n; i>=1; i--) r[i]=max(r[i+1], a[i+1].first-b[i]);
for (int i=1; i<=n+1; i++) ans[a[i].second]=max(l[i], r[i]);
for (int i=1; i<=n+1; i++) cout<<ans[i]<<' ';
}
