#include <bits/stdc++.h>
#define task "BriantheCrab"
#define int long long
#define pii pair <int, int>
#define fi first
#define se second
#define szf sizeof
#define sz(s) (int)((s).size())
#define all(v) (v).begin(), (v).end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
template <class T> void minimize (T &t, T f) {if (t > f) t = f;}
template <class T> void maximize (T &t, T f) {if (t < f) t = f;}
const int maxN = 2e5 + 5;
const int inf = 1e18 + 7;
const int mod = 1e9 + 7;
// khong tu code thi khong kha len duoc dau
struct ST {
vector <int> st;
void init (int _n) {
st.assign (_n * 4, 0);
return;
}
void upd (int id, int l, int r, int pos, int val) {
if (pos < l || pos > r) {
return;
}
if (l == r) {
st[id] = val;
return;
}
int mid = (l + r) >> 1;
upd (id * 2, l, mid, pos, val);
upd (id * 2 + 1, mid + 1, r, pos, val);
st[id] = max (st[id * 2], st[id * 2 + 1]);
}
int get (int id, int l, int r, int u, int v) {
if (l > v || r < u) {
return 0;
}
if (u <= l && r <= v) {
return st[id];
}
int mid = (l + r) >> 1;
int tL = get (id * 2, l, mid, u, v);
int tR = get (id * 2 + 1, mid + 1, r, u, v);
return max (tL, tR);
}
};
pii a[maxN];
int b[maxN], res[maxN];
ST T[2];
void solve () {
int n;
cin >> n;
for (int i = 1; i <= n + 1; i ++) {
int x;
cin >> x;
a[i] = {x, i};
}
for (int i = 1; i <= n; i ++) {
cin >> b[i];
}
sort (a + 1, a + n + 2);
sort (b + 1, b + n + 1);
T[0].init (n + 1);
T[1].init (n + 1);
for (int i = 1; i <= n; i ++) {
T[0].upd (1, 1, n, i, a[i].fi - b[i]);
T[1].upd (1, 1, n, i, a[i + 1].fi - b[i]);
}
for (int i = 1; i <= n + 1; i ++) {
int id = a[i].se;
if (i > n) {
res[id] = T[0].get (1, 1, n, 1, n);
break;
}
int t0 = T[0].get (1, 1, n, 1, i - 1);
int t1 = T[1].get (1, 1, n, i, n);
res[id] = max (t0, t1);
}
for (int i = 1; i <= n + 1; i ++) {
cout << res[i] << ' ';
}
return;
}
signed main () {
cin.tie (nullptr) -> sync_with_stdio (false);
if (fopen (task".inp", "r")) {
freopen (task".inp", "r", stdin);
freopen (task".out", "w", stdout);
}
int t = 1;
//cin >> t;
while (t --) {
solve ();
}
return 0;
}
// thfv
