#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int N;
cin >> N;
vector<pair<int, int>> A(N + 1);
for (int i = 0; i <= N; i++) {
cin >> A[i].first;
A[i].second = i;
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
sort(begin(A), end(A));
sort(begin(B), end(B));
vector<int> pref(N + 1);
vector<int> suff(N + 1);
for (int i = 0; i < N; i++) {
pref[i] = max(A[i].first - B[i], 0);
suff[i] = max(A[i + 1].first - B[i], 0);
}
for (int i = 1; i < N; i++) {
pref[i] = max(pref[i], pref[i - 1]);
}
for (int i = N - 2; i >= 0; i--) {
suff[i] = max(suff[i], suff[i + 1]);
}
vector<int> ans(N + 1, 0);
for (int i = 0; i <= N; i++) {
ans[A[i].second] = max((i > 0 ? pref[i - 1] : 0), (i < N ? suff[i] : 0));
}
for (int i = 0; i <= N; i++) {
cout << ans[i] << " \n"[i == N];
}
return 0;
}
