#include<bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
#define int long long
#define pii pair<int,int>
int n;
pii a[MAXN];
int b[MAXN];
int pre[MAXN];
int suf[MAXN];
int ans[MAXN];
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
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];
}
sort(b + 1, b + n + 1);
sort(a + 1, a + n + 2);
for (int i = 1; i <= n; i++)
{
pre[i] = max(pre[i - 1], max(0LL, a[i].first - b[i]));
}
for (int i = n; i >= 1; i--)
{
suf[i] = max(suf[i + 1], max(0LL, a[i + 1].first - b[i]));
}
for (int i = 1; i <= n + 1; i++)
{
int trc = pre[i - 1];
int sau = suf[i];
ans[a[i].second] = max(trc, sau);
}
for (int i = 1; i <= n + 1; i++)
{
cout << ans[i] << " ";
}
}
