#include <bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(false); cin.tie(nullptr);
#define s(x) x.size()
#define sort(x) sort(x.begin(),x.end())
#define rsort(x) sort(x.rbegin(),x.rend())
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define fi first
#define se second
#define INF 1e9
#define INFL 1e18
#define rep(a,b) for(int a = 0;a<b;a++)
using ll = long long;
using pii = pair<int, int>;
void solve() {
int n;
cin >> n;
vector<pair<int,int>>v(n+1);
vector<int>v2(n);
for (int i = 0; i < n+1; i++) {
cin >> v[i].first;
v[i].second = i;
}
for (int i = 0; i < n; i++) {
cin >> v2[i];
}
sort(v);
sort(v2);
vector<int>prefix(n+1),suffix(n+1);
vector<int>wynik(n+1);
for (int i = 0; i < n; i++) {
prefix[i+1] = max(prefix[i],v[i].first-v2[i]);
}
for (int i = n-1; i >=0; i--) {
suffix[i] = max(suffix[i+1],v[i+1].first-v2[i]);
}
for (int i = 0; i <= n; i++) {
wynik[v[i].second] = max(prefix[i],suffix[i]);
}
for (int i = 0; i <= n; i++) {
cout << wynik[i] << ' ';
}
}
int main() {
fastio;
int t = 1;
// cin >> t;
while (t--) solve();
return 0;
}
