#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define f first
#define s second
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n; cin >> n;
vector<int> a(n+1);
for (int i=0; i<=n; i++) {
cin >> a[i];
}
vector<int> b(n);
for (int i=0; i<n; i++) {
cin >> b[i];
}
vector<int> ans(n+1);
for (int i=0; i<=n; i++) {
vector<int> c;
for (int j=0; j<=n; j++) {
if (j==i) continue;
c.push_back(a[j]);
}
sort(c.begin(), c.end());
sort(b.begin(), b.end());
int ck = 0;
for (int i=0; i<n; i++) {
ck = max(ck, max(0, c[i]-b[i]));
}
ans[i] = ck;
}
for (auto x : ans) {
cout << x << " ";
}
cout << "\n";
}
