#include <bits/stdc++.h>
using namespace std;
int n;
vector<pair<int, int>> a;
vector<int> b, prefLeft, prefRight, results;
int main()
{
// freopen("inp.txt", "r", stdin);
ios::sync_with_stdio(false);
cin >> n;
a.resize(n + 3); b.resize(n + 3);
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(a.begin() + 1, a.begin() + n + 2);
sort(b.begin() + 1, b.begin() + n + 1);
prefLeft.resize(n + 3);
for (int i = 1; i <= n; i++)
prefLeft[i] = max(prefLeft[i - 1], max(a[i].first - b[i], 0));
prefRight.resize(n + 3);
for (int i = n + 1; i >= 2; i--)
prefRight[i] = max(prefRight[i + 1], max(a[i].first - b[i - 1], 0));
/*
for (int i = 1; i <= n + 1; i++)
cout << prefLeft[i] << ' ';
cout << endl;
for (int i = 1; i <= n + 1; i++)
cout << prefRight[i] << ' ';
cout << endl;
*/
results.resize(n + 3);
for (int i = 1; i <= n + 1; i++)
results[a[i].second] = max(prefLeft[i - 1], prefRight[i + 1]);
for (int i = 1; i <= n + 1; i++)
cout << results[i] << ' ';
}
