#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define int long long
signed main()
{
int n;cin>>n;
pair<int,int> a[n+50];for(int i=1;i<=n+1;i++){cin>>a[i].fi;a[i].se=i;}
int b[n+50];
for(int i=1;i<=n;i++)cin>>b[i];
sort(a+1,a+n+2);
sort(b+1,b+n+1);
int res[n+50]={0},sum=0;
for(int i=1;i<=n;i++)
{
sum=max(sum,max(a[i].fi-b[i],(int)0));
}
res[a[n+1].se]=sum;
for(int i=n;i>=1;i--)
{
//sum-=max(a[i].fi-b[i],0);
sum=max(sum,max(a[i+1].fi-b[i],(int)0));
res[a[i].se]=sum;
}
for(int i=1;i<=n+1;i++) cout<<res[i]<<" ";
cout<<endl;
return 0;
}
