#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f first
#define s second
#define int long long
#define ll long long
#define pii pair<int,int>
#define ar array
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update> ordered_set;
const int inf = 1e17 + 7;
const int mod = 1e9 + 7;
const int N = 3e5 + 5;
const int md = 998244353;
int binpow(int a, int b){
if(b == 0)return 1;
if(b % 2 == 0){
int c = binpow(a,b/2);
return (c*c)%mod;
}
return (binpow(a,b-1)*a)%mod;
}
int divi(int a, int b){
return (a*(binpow(b,mod-2)))%mod;
}
int n,m,k;
void solve(){
cin >> n;
vector<int>a(n+1), b(n);
for(auto &to:a)cin >> to;
for(auto &to:b)cin >> to;
vector<pii>v;
for(int i = 0;i<=n;i++){
v.pb({a[i], i});
}
sort(all(v));
sort(all(a));
sort(all(b));
vector<int>ans(n+1);
map<int,int>mp;
for(int i = 0;i<=n;i++){
mp[i] = v[i].s;
}
vector<int>pref(n+1),suff(n+1);
for(int i = 0;i<n;i++){
pref[i] = max(a[i]-b[i], 0ll);
if(i)pref[i] = max(pref[i], pref[i-1]);
}
for(int i = n;i>0;i--){
suff[i] = max(a[i]-b[i-1], 0ll);
if(i < n)suff[i] = max(suff[i], suff[i+1]);
}
for(int i = 0;i<=n;i++){
if(i && i < n)ans[mp[i]] = max(pref[i-1], suff[i+1]);
else if(i < n)ans[mp[i]] = suff[i+1];
else ans[mp[i]] = pref[i-1];
}
for(int i = 0;i<=n;i++){
cout << ans[i] << " ";
}
}
/*
*/
signed main()
{
// freopen("seq.in", "r", stdin);
// freopen("seq.out", "w", stdout);
ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
int tt=1;//cin>>tt;
while(tt--)solve();
}
