#include<bits/stdc++.h>
using namespace std;
#define foru(i,a,b) for(int i=(a); i<=(b); ++i)
#define ford(i,a,b) for(int i=(a); i>=(b); --i)
#define sz(a) (int)(a).size()
#define all(a) (a).begin(),(a).end()
#define bit(s,i) (((s)>>(i))&1)
#define ii pair<int,int>
#define fi first
#define se second
#define ll long long
#define eb emplace_back
#define pb push_back
#define __builtin_popcount __builtin_popcountll
template <class X, class Y> bool maxi(X &x, Y y){return x<y?x=y,true:false;}
template <class X, class Y> bool mini(X &x, Y y){return x>y?x=y,true:false;}
const int N=202020;
int n,b[N],p[N],s[N],ans[N];
ii a[N];
void solve(){
cin>>n;
foru(i,1,n+1){
cin>>a[i].fi;
a[i].se=i;
}
foru(i,1,n) cin>>b[i];
sort(a+1,a+2+n);
sort(b+1,b+1+n);
foru(i,1,n){
p[i]=max(p[i-1],max(0,a[i].fi-b[i]));
}
ford(i,n,1){
s[i]=max(s[i+1],max(0,a[i+1].fi-b[i]));
}
foru(i,1,n+1){
ans[a[i].se]=max(p[i-1],s[i]);
}
foru(i,1,n+1) cout<<ans[i]<<" ";
}
signed main(){
#define task "test"
if(fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
cin.tie(0)->sync_with_stdio(0);
solve();
}
