#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <unordered_map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
#define ll long long
#define ld long double
#define inf (ll)(2*1e18)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define pb push_back
#define endl "\n"
using namespace std;
void solve(){
ll n, i, x;
cin>>n;
vector<pair<ll, ll>> a(n+1);
vector<ll> b(n);
vector<ll> c(n);
vector<ll> d(n+1);
vector<ll> ans(n+1);
for(i=0;i<=n;++i){
cin>>x;
a[i] = {x, i};
}
for(i=0;i<n;++i){
cin>>b[i];
}
sort(a);
sort(b);
for(i=0;i<n;++i){
c[i] = max(a[i].first - b[i], 0ll);
d[i] = max(a[i+1].first - b[i], 0ll);
}
for(i=1;i<n;++i){
c[i] = max(c[i], c[i-1]);
}
for(i=n-1;i>=0;--i){
d[i] = max(d[i], d[i+1]);
}
ans[a[0].second] = d[0];
for(i=1;i<=n;++i){
ans[a[i].second] = max(c[i-1], d[i]);
}
for(i=0;i<=n;++i){
cout<<ans[i]<<' ';
}
cout<<endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
srand(time(nullptr));
ll t=1;
// cin>>t;
for(;t>0;--t){
solve();
}
return 0;
}
