// #pragma GCC optimize("O3")
// #pragma GCC optimization("Ofast,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i, l, r) for (int i = (l); i <= (r); i++)
#define FOD(i, r, l) for (int i = (r); i >= (l); i--)
#define fi first
#define se second
#define pii pair<int, int>
const ll mod = 1e9 + 7;
const int MAXN = 2e5 + 5;
const ll oo = 1e18+7;
const int base = 0;
int n;
pii a[MAXN];
int b[MAXN];
int ps1[MAXN], ps2[MAXN], res[MAXN];
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("test.txt", "r", stdin);
// freopen("o2.out", "w", stdout);
// if(fopen(".inp", "r")){
// freopen(".inp", "r", stdin);
// freopen(".out", "w", stdout);
// }
cin >> n;
FOR(i, 1, n+1){
cin >> a[i].fi;
a[i].se=i;
}
FOR(i, 1, n){
cin >> b[i];
}
sort(a+1, a+1+n+1);
sort(b+1, b+1+n);
FOR(i, 1, n+1){
ps1[i]=max(ps1[i-1], a[i].fi-b[i]);
}
FOD(i, n, 1){
ps2[i]=max(ps2[i+1], a[i+1].fi-b[i]);
}
FOR(i, 1, n+1){
res[a[i].se]=max(ps1[i-1], ps2[i]);
}
FOR(i, 1, n+1){
cout << res[i] << ' ';
}
return 0;
}
