#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
void Solve()
{
int n; cin >> n;
vector <int> a(n + 1), b(n);
for (auto &x : a) cin >> x;
for (auto &x : b) cin >> x;
for (int i = 0; i <= n; i++){
vector <int> c;
for (int j = 0; j <= n; j++){
if (i != j) c.push_back(a[j]);
}
sort(b.begin(), b.end());
sort(c.begin(), c.end());
int ans = 0;
for (int j = 0; j < n; j++) ans = max(ans, c[j] - b[j]);
cout << ans << " ";
}
}
int32_t main()
{
auto begin = std::chrono::high_resolution_clock::now();
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
// cin >> t;
for(int i = 1; i <= t; i++)
{
//cout << "Case #" << i << ": ";
Solve();
}
auto end = std::chrono::high_resolution_clock::now();
auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
return 0;
}
