#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
const int N=2e5+5;
signed main(){
int n;
cin>>n;
vector<int>b(n+5);
vector<int>ans(n+5);
vector<pair<int,int>> a(n+5);
for(int i=1;i<=n+1;i++){
cin>>a[i].ff;
a[i].ss=i;
}
for(int i=1;i<=n;i++)cin>>b[i];
sort(a.begin(),a.end());
sort(b.begin(),b.end());
multiset<int>st={0};
return 0;
for(int i=1;i<=n;i++){
st.insert(max(0, a[i+1].ff - b[i]));
}
ans[a[1].ss]= *prev(st.end());
for(int i=2;i<=n+1;i++){
st.erase(st.find(max(0,a[i].ff-b[i-1])));
st.insert(max(0, a[i-1].ff - b[i-1]));
ans[a[i].ss]=*prev(st.end());
}
for(int i=1;i<=n+1;i++)cout<<ans[i]<<" ";
}
