#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n;
vector<int> a, b;
int solve(int ceo) {
vector<int> c;
for (int i = 0; i < n + 1; i++) {
if (i != ceo) c.push_back(a[i]);
}
sort(c.begin(), c.end());
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, max(c[i] - b[i], 0));
}
return ans;
}
int main() {
cin >> n;
a.resize(n), b.resize(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
sort(b.begin(), b.end());
for (int i = 0; i < n + 1; i++) {
cout << solve(i) << ' ';
}
cout << '\n';
return 0;
}
