#include <bits/stdc++.h>
#include <experimental/random>
#include <random>
using namespace std;
using ll = long long;
using ld = long double;
const ll INF = 1e18, MOD = 998244353;
void solve();
signed main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll q = 1;
//cin >> q;
while (q--) {
solve();
}
}
void solve() {
ll n;
cin >> n;
vector<ll> a(n + 1);
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
vector<ll> b(n);
for (int i = 0; i < n; i++) {
cin >> b[i];
}
sort(b.begin(), b.end());
for (int i = 0; i <= n; i++) {
vector<ll> c;
for (int j = 0; j <= n; j++) {
if (i != j) {
c.push_back(a[j]);
}
}
sort(c.begin(), c.end());
ll ans = 0;
for (int j = 0; j < n; j++) {
ans = max(ans, c[j] - b[j]);
}
cout << ans << ' ';
}
}
