#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define FF first.first
#define FS first.second
#define pb push_back
using namespace std;
const ll N=1000006, INF=1e18, P=998244353;
ll q=1, n, m, x, y, z, l, r, c, k, b[N], f[N], ansl, ansr, ans, o, u, Ans[N];
vector <pii> v[N], V;
pii a[N];
void solve(){
cin>>n;
for(int i=0; i<=n; i++){
cin>>a[i].F;
a[i].S=i;
}
for (int i=0; i<n; i++){
cin>>b[i];
}
sort(a, a+n+1);
sort(b, b+n);
set<pii> s;
for (int i=0; i<n; i++){
s.insert({b[i]-a[i+1].F, i});
}
Ans[a[0].S]=max(0, -(*s.begin()).F);
for (int i=0; i<n; i++){
s.erase({b[i]-a[i+1].F, i});
s.insert({b[i]-a[i].F, i});
Ans[a[i+1].S]=max(0, -(*s.begin()).F);
}
for (int i=0; i<=n; i++)cout<<Ans[i]<<" ";
}
main(){ios_base::sync_with_stdio(false), cin.tie(0);
int T=1;
//cin>>T;
while(T--){
solve();
}
}
