/* Ajay Jadhav */
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <deque>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <ctime>
#include <string.h>
#include <climits>
#include <cstring>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
#define endl '\n'
void solve()
{
int n;
cin >> n;
vi a(n + 1), b(n);
set<int> st;
rep(i, 0, n + 1)
{
int x;
cin >> x;
a[i] = x;
st.insert(x);
}
rep(i, 0, n)
{
cin >> b[i];
}
sort(all(b));
vi ans(n + 1);
rep(i, 0, n + 1)
{
int to_remove = a[i];
int d = 0, index = 0;
st.erase(st.find(to_remove));
for (int a : st)
{
d = max(d, max(a - b[index++], 0));
}
ans[i] = max(ans[i], d);
st.insert(to_remove);
cout << ans[i] << " ";
}
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--)
{
solve();
}
return 0;
}
