#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#define bupol __builtin_popcount
#define int long long
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
const int MAXN = 1e5+10;
const int MAXK = 2010;
const int LOG = 20;
const int MOD = 1e9+7;
const int SQRT = 520;
const int INF = 1e9+10;
typedef pair<int,int> pii;
typedef pair<int,pii> ipii;
int n;
int a[MAXN], b[MAXN], ans[MAXN];
vector <pii> vec;
bool cek(int x, int p){
int j = n, mx = 0;
for(int i=n-1; i>=0; i--){
if(vec[j].se==p) j--;
mx = max(mx, vec[j].fi-b[i]);
j--;
}
return (mx <= x);
}
int bin(int p){
int l=0, r = INF, mid=0, cnt=0;
while(l<=r){
mid = md;
if(cek(mid, p)){
r = mid-1; cnt = mid;
} else l = mid+1;
}
//cout << p << ' ' << cnt << " p\n";
return cnt;
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n;
for(int i=0; i<=n; i++){
cin >> a[i]; vec.pb({a[i], i});
}
sort(vec.begin(), vec.end());
for(int i=0; i<n; i++) cin >> b[i];
sort(b+0, b+n);
for(int i=0; i<n+1; i++){
ans[vec[i].se] = bin(vec[i].se);
}
for(int i=0; i<n+1; i++) cout << ans[i] << " \n"[i==n];
}
