#include <bits/stdc++.h>
#define ii pair<int,int>
#define f first
#define s second
#define pb push_back
#define int long long
#define endl '\n'
using namespace std;
const int MAXN = 1e18;
int mod = 1e9 + 7;
int a[200005];
int b[200005];
void AcSolution()
{
int n;
cin >> n;
for(int i = 1;i <= n + 1;i++)
{
cin >> a[i];
}
for(int i = 1;i <= n;i++)
{
cin >> b[i];
}
sort(b + 1,b + n + 1);
for(int i = 1;i <= n + 1;i++)
{
vector<int> c;
c.push_back(0);
for(int j = 1;j <= n + 1;j++)
{
if(j != i)
{
c.push_back(a[j]);
}
}
sort(c.begin(),c.end());
int ma = INT_MIN;
for(int k = 1;k <= n;k++)
{
ma = max(ma,max(c[k] - b[k],0ll));
}
cout << ma << " ";
}
cout << endl;
}
signed main()
{
// ifstream cin("A.inp");
// ofstream cout("A.ans");
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
while(t--)
{
AcSolution();
}
}
