#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5;
int n, b[maxn + 5], pre[maxn + 5], suf[maxn + 5], ans[maxn + 5];
pair<int, int> a[maxn + 5];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n + 1; ++i){
cin >> a[i].first;
a[i].second = i;
}
for (int i = 1; i <= n; ++i){
cin >> b[i];
}
sort(a + 1, a + n + 2); sort(b + 1, b + n + 1);
for (int i = 1; i <= n; ++i){
pre[i] = max(pre[i - 1], a[i].first - b[i]);
}
for (int i = n + 1; i >= 2; --i){
suf[i] = max(suf[i + 1], a[i].first - b[i - 1]);
}
for (int i = 1; i <= n + 1; ++i){
ans[a[i].second] = max(pre[i - 1], suf[i + 1]);
}
for (int i = 1; i <= n + 1; ++i) cout << ans[i] << ' ';
return 0;
}
