#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update>
#define int long long
#define double long double
#define pii pair <int, int>
#define tiii tuple <int, int, int>
#define tiiii tuple <int, int, int, int>
#define emb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)
#define matrix vector <vector <int>>
#define mat(n, m) vector <vector <int>> (n, vector <int> (m));
const int mod = 1e9 + 7;
const int inf = 1e18;
const matrix II = {{1, 0}, {0, 1}};
const int N = 2e5 + 5;
void solve(){
int n; cin >> n;
vector <pii> a(n + 2); for (int i = 1; i <= n + 1; i++) cin >> a[i].first, a[i].second = i;
vector <int> b(n + 1); for (int i = 1; i <= n; i++) cin >> b[i];
sort(a.begin() + 1, a.begin() + 1 + n + 1);
sort(b.begin() + 1, b.begin() + 1 + n);
vector <int> pref(n + 3), suf(n + 3);
for (int i = 1; i <= n; i++) {
pref[i] = max(pref[i - 1], max(a[i].first - b[i], 0ll));
}
for (int i = n; i >= 1; i--) {
suf[i + 1] = max(suf[i + 2], max(a[i + 1].first - b[i], 0ll));
}
vector <int> ans(n + 2);
for (int i = 1; i <= n + 1; i++) {
ans[a[i].second] = max(pref[i - 1], suf[i + 1]);
}
for (int i = 1; i <= n+1; i++) {
cout << ans[i] << " ";
}
}
int32_t main(){
iShowSpeed;
// int q; cin >> q; while (q--)
solve();
}
