#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _34raRxL ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
void print(){cout<<"\n";}
template<class te,class ...ti>
void print(const te&v,const ti&...nv){cout<<v;if(sizeof...(nv)){cout<<" ";print(nv...);}}
//e
typedef long long ll;
typedef long double ld;
using pii=pair<int,int>;
using vi=vector<int>;
int main(){
_34raRxL;
int n;
cin>>n;
vec(pii) a;
rep(i,n+1){
int x;
cin>>x;
a.pb({x,i});
}
vi b(n);
rep(i,n){
cin>>b[i];
}
sort(all(b));
sort(all(a));
multiset<int> mst;
rep(i,n){
int x=a[i].fi,y=b[i];
mst.insert(max(0,x-y));
}
vi pans(n+1,-1);
drep(i,n){
int id=a[i+1].se;
pans[id]=*prev(mst.end());
mst.erase(mst.find(max(0,a[i].fi-b[i])));
mst.insert(max(0,a[i+1].fi-b[i]));
}
pans[a[0].se]=*prev(mst.end());
rep(i,n+1){
print(pans[i],"");
}
print();
//
return 0;
}
