#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#pragma GCC optimize ("Ofast")
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n;
cin>>n;
vector<pair<int,int>> vcc(n+1);
vector<int> b(n),c(n+1);
for (int i = 0; i < n+1; ++i)
{
cin>>vcc[i].first;
vcc[i].second = i;
}
for (int i = 0; i < n; i++)
{
cin>>b[i];
}
sort(vcc.begin(),vcc.end());
sort(b.begin(),b.end());
for (int i = 0; i < n+1; i++)
{
int p = 0;
int mxx = 0;
for (int j = 0; j < n; j++)
{
if (vcc[p].second == i)
++p;
mxx = max(mxx, vcc[p].first - b[j]);
++p;
}
c[i] = mxx;
}
for (int i = 0; i < n+1; ++i)
{
cout<<c[i]<<' ';
}
cout<<endl;
return 0;
}
