#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n;
int main() {
cin >> n;
vector<int> ties(n + 1);
vector<int> current(n);
for (int i = 0; i <= n; i++) {
cin >> ties[i];
}
for (int i = 0; i < n; i++) {
cin >> current[i];
}
sort(ties.begin(), ties.end());
sort(current.begin(), current.end());
vector<int> start = {0};
vector<int> shifted = {0};
int temp1 = 0;
int temp2 = 0;
for (int i = 0; i < n; i++) {
temp1 = max(temp1, ties[i] - current[i]);
start.push_back(temp1);
}
start.push_back(max(temp1, ties[n] - current[n - 1]));
for (int i = n - 1; i >= 0; i--) {
temp2 = max(temp2, ties[i + 1] - current[i]);
shifted.push_back(temp2);
}
reverse(shifted.begin(), shifted.end());
//indexing issue below?
for (int i = 0; i <= n; i++) {
cout << max(start[i], shifted[i]) << ' ';
}
}
