#include <bits/stdc++.h>
using namespace std;
#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second
const int M = 1e9+7;
const int inf = 1e18;
const int N = 4e5+10;
int bp(int x, int y, int p){
int res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int MI(int n, int p){
return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
return x * 1ull * y % p;
}
int di(int x,int y, int p){
return mul(x, MI(y, p), p);
}
int n , m , k , q;
void solve(int testcase_number){
cin>>n;
input(int,a,n+1);
input(int,ini,n);
sort(all(ini));
vector<vector<int>>ord;
for(int i = 0;i<=n;i++){
ord.pb({a[i],i});
}
sort(all(ord));
vector<int>sm;
sm.pb(-inf);
int ans = 0;
for(int i = n;i>=1;i--){
sm.pb(max(sm.back(),max(0ll,ord[i][0]-ini[i-1])));
}
reverse(all(sm));
// print(sm);
vector<int>fans(n+1,0);
fans[ord[0][1]] = sm[0];
// ans = ord[0][0];
for(int i = 1;i<=n;i++){
ans=max({0ll,ord[i-1][0]-ini[i-1],ans});
fans[ord[i][1]] = max(ans,sm[i]);
}
print(fans);
}
signed main(){
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);
cout << fixed<<setprecision(9);
int t = 1;
// cin>>t;
for(int i = 1;i<=t;i++){
solve(i);
}
}
