#include <bits/stdc++.h>
using namespace std;
template<class T, class U>
void ckmin(T &a, U b)
{
if (a > b) a = b;
}
template<class T, class U>
void ckmax(T &a, U b)
{
if (a < b) a = b;
}
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define SZ(x) ((int) (x).size())
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
const int MAXN = 200013;
int N;
pll A[MAXN];
ll B[MAXN];
ll ans[MAXN];
multiset<ll> vals;
int32_t main()
{
cout << fixed << setprecision(12);
cerr << fixed << setprecision(4);
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> N;
FOR(i, 0, N + 1)
{
cin >> A[i].fi; A[i].se = i;
}
FOR(i, 0, N)
{
cin >> B[i];
}
sort(A, A + N + 1);
sort(B, B + N);
vals.insert(0);
FOR(i, 0, N)
{
vals.insert(A[i].fi - B[i]);
ans[A[N].se] = *vals.rbegin();
}
FORD(i, N, 0)
{
//originally i matched with i. now it matches with i+1.
vals.erase(vals.find(A[i].fi - B[i]));
vals.insert(A[i + 1].fi - B[i]);
ans[A[i].se] = *vals.rbegin();
}
FOR(i, 0, N + 1)
{
cout << ans[i] << " \n"[i == N];
}
return 0;
}
