#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1000'000'000'000'000'000LL;
const int II = 2'000'000'000;
const ll M = 1000'000'007LL;
const int N = 1000'007;
int pre[N], suf[N];
pair<int, int> val[N];
int tab[N], answer[N];
void Solve()
{
int n;
cin >> n;
for(int i = 1; i <= n + 1; ++i)
{
cin >> val[i].st;
val[i].nd = i;
}
sort(val + 1, val + 1 + n + 1);
for(int i = 1; i <= n; ++i)
cin >> tab[i];
sort(tab + 1, tab + 1 + n);
for(int i = 1; i <= n; ++i)
pre[i] = max(pre[i - 1], val[i].st - tab[i]);
for(int i = n; i >= 1; --i)
suf[i] = max(suf[i + 1], val[i + 1].st - tab[i]);
for(int i = 1; i <= n + 1; ++i)
answer[val[i].nd] = max(pre[i - 1], suf[i]);
for(int i = 1; i <= n + 1; ++i)
cout << answer[i] << " ";
cout << "\n";
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
//int t; cin >> t;
//while(t--)
Solve();
return 0;
}
