//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("bmi,bmi2,lzcnt,popcnt")
//#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
//#pragma expected_value
//#pragma isolated_call
//#pragma disjoint
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
#define int long long
//#define double long double
#define Fi first
#define Se second
#define Rep(i,a,b) for (int i=a;i<=b;++i)
#define Repu(i,b,a) for (int i=b;i>=a;--i)
#define pb push_back
#define ms(a,i) memset(a,i,sizeof(a))
#define sz size()
#define mp make_pair
#define endl '\n'
#define sef setprecision(12)<<fixed
#define cer cout<<"cak"<<endl;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<double> va;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<va> vva;
//const double EPS=1e-9;
const double PI=acos(-1);
//const int oo=1e18;
const int MN=2e5+5;
const int mod=1e9+7;
using cd=complex<double>;
//typedef tree<int,null_type,less<int>,rb_tree_tag, tree_order_statistics_node_update> index_set;
int n;
int a[MN];
int b[MN];
int Max(int x,int y) {
if(x>=y) return x;
return y;
}
int doc[MN], cheo[MN];
ii A[MN];
int ans[MN];
signed main() {
//freopen(".inp","r",stdin); freopen(".out","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>n;
Rep(i,1,n+1) cin>>a[i];
Rep(i,1,n) cin>>b[i];
sort(b+1,b+n+1);
/*if(n<=2000) {
Rep(i,1,n+1) {
multiset<int> s;
Rep(j,1,n+1) if(i!=j) s.insert(a[j]);
int c=0;
auto itr = s.begin();
Rep(j,1,n) {
c = Max(c,Max(*itr-b[j],0));
//cout<<*itr<<" ";
itr++;
}
cout<<c<<" ";
}
return 0;
}*/
Rep(i,1,n+1) {
A[i] = mp(a[i],i);
}
sort(A+1, A+n+2);
Rep(i,1,n) {
doc[i] = Max(doc[i-1], Max(A[i].Fi-b[i],0));
}
Repu(i,n,1) {
cheo[i] = Max(cheo[i+1], Max(A[i+1].Fi-b[i],0));
}
Rep(i,1,n+1) {
int id = A[i].Se;
ans[id] = Max(doc[i-1], cheo[i]);
}
Rep(i,1,n+1) cout<<ans[i]<<" ";
}
