#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using P = pair<int, int>;
#define all(x) x.begin(), x.end()
#define rep(i, l, n) for (int i = l; i < (n); ++i)
#define sz(x) (int)x.size()
const char nl = '\n';
const int mod = 998244353;
void solve() {
int n; cin >> n;
vector<int> a(n+1), b(n);
for (auto &i: a)cin >> i;
for (auto &i: b)cin >> i;
sort(all(b));
multiset<int> ms;
for (auto i: a)ms.insert(i);
rep(i, 0, n+1) {
ms.erase(ms.find(a[i]));
auto it = ms.begin();
int res = 0;
rep(j, 0, n)
res = max(res, *it++-b[j]);
ms.insert(a[i]);
cout << res << " ";
}
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
