#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll INF = 1e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
ll n;
cin >> n;
vector<pair<ll, ll>> s(n + 1);
for (ll i = 0; i <= n; i++) {
cin >> s[i].first;
s[i].second = i;
}
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
std::sort(s.begin(), s.end());
vector<ll> answer(n + 1);
multiset<ll> st;
for (ll i = 0; i < n; i++) {
st.insert(abs(a[i] - s[i + 1].first));
}
answer[s[0].second] = *st.rbegin();
for (ll i = 1; i <= n; i++) {
st.erase(st.find(abs(a[i - 1] - s[i].first)));
st.insert(abs(a[i - 1] - s[i - 1].first));
answer[s[i].second] = *st.rbegin();
}
for (ll i = 0; i < answer.size(); i++) {
cout << answer[i] << " ";
}
}
