#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
#define sz size()
#define veg vegeta
#define harderahhh ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
const int N = 1e9+7;
const int M = 998244353;
using namespace std;
ll x, l, y, t, z, hp, sus1, sus2, g, sus, sus3, bruh, bruh1, bruh2, bruh3, dog1, h, r, dog2, dog3;
ll ck1, ck2, ck3, dog, i, p, j, q, m, a[1000005], b[696969], c[696969], n, k, d[2000005], e[696969];
ll x2[696969], x17[696969], x1[696969], joy[1005][1005], pp[1005][1005], di[1234566], de[1234566];
string s1, s2, s3, s4, s5, s6, s7, s8, s9, rep1, rep2, rep, s, hsr[696969], gi[696969];
char c1, c2, oon, hi[1005][1005], na[1005][1005], cc[696969], dd[696969];
pair <ll, ll> goku[696969], veg[696969];
vector <ll> aag[1000005], eeg[200005], ski, bidi;
bool vis[200005];
map <pair<ll,ll>, ll> mm;
map <ll, ll> wii;
set <ll> kk;
void dfs(ll x) {
}
int main() {
harderahhh;
cin >> n;
for (i = 1; i <= n+1; i++) {
cin >> goku[i].ff;
goku[i].ss = i;
}
sort (goku+1, goku+n+2);
for (i = 1; i <= n; i++) {
cin >> b[i];
}
sort (b+1, b+n+1);
for (i = 1; i <= n; i++) {
x = max(goku[i].ff-b[i], 0ll);
c[i] = max(x, c[i-1]);
}
for (i = n; i >= 1; i--) {
x = max(goku[i+1].ff-b[i], 0ll);
d[i+1] = max(d[i+2], x);
}
for (i = 1; i <= n+1; i++) {
e[goku[i].ss] = max(c[i-1],d[i+1]);
}
for (i = 1; i <= n+1; i++) {
cout << e[i] << " ";
}
}
