#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pii pair<int, int>
#define fi first
#define se second
#define __builtin_popcount __builtin_popcountll
#define all(x) (x).begin(), (x).end()
#define BIT(x, i) (((x) >> (i)) & 1)
#define debug(a, l, r) for (int i = (l); i <= (r); ++i) cout << (a)[i] << ' '; cout << '\n';
const int MAXN = 2e5 + 5;
int n, b[MAXN], pref[MAXN], suff[MAXN], res[MAXN];
pii a[MAXN];
signed main() {
#ifdef NCTHANH
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(nullptr); cout.tie(nullptr);
cin >> n;
for (int i = 1; i <= n + 1; ++i) {
cin >> a[i].fi; a[i].se = i;
}
for (int i = 1; i <= n; ++i) cin >> b[i];
sort(a + 1, a + n + 2);
sort(b + 1, b + n + 1);
for (int i = 1; i <= n; ++i) {
int cur = max(a[i].fi - b[i], 0ll);
pref[i] = max(pref[i - 1], cur);
}
for (int i = n + 1; i >= 2; --i) {
int cur = max(a[i].fi - b[i - 1], 0ll);
suff[i] = max(suff[i + 1], cur);
}
for (int i = 1; i <= n + 1; ++i) {
int cur = max(pref[i - 1], suff[i + 1]);
res[a[i].se] = cur;
}
for (int i = 1; i <= n + 1; ++i) cout << res[i] << ' ';
return 0;
}
