#include <iostream>
#include <algorithm>
using namespace std;
int n, l[200010], maxim = -1, ap_maxim, raspuns[200010];
struct necktie
{
int l, indice;
} v[200010];
struct max_in_
{
int maxim;
int ap;
} maxim_in_dreapta[200010], maxim_in_stanga[200010];
bool criteriu (necktie a, necktie b)
{
return a.l <= b.l;
}
int main()
{
cin >> n;
for (int i = 1; i <= n + 1; i++)
{
cin >> v[i].l;
v[i].indice = i;
}
for (int i = 1; i <= n; i++)
cin >> l[i];
sort (l + 1, l + n + 1);
sort (v + 1, v + n + 2, criteriu);
for (int i = 1; i <= n; i++)
{
if (max (v[i + 1].l - l[i], 0) > maxim)
{
maxim = max (v[i + 1].l - l[i], 0);
ap_maxim = 1;
}
else if (max (v[i + 1].l - l[i], 0) == maxim)
{
ap_maxim ++;
}
}
for (int i = n; i >= 1; i--)
{
maxim_in_dreapta[i].maxim = maxim_in_dreapta[i + 1].maxim;
maxim_in_dreapta[i].ap = maxim_in_dreapta [i + 1].ap;
if (maxim_in_dreapta[i].maxim < max(v[i + 1].l - l[i], 0))
{
maxim_in_dreapta[i].maxim = max(v[i + 1].l - l[i], 0);
maxim_in_dreapta[i].ap = 1;
}
else if (maxim_in_dreapta[i].maxim == max(v[i + 1].l - l[i], 0))
{
maxim_in_dreapta[i].ap ++;
}
}
raspuns[v[1].indice] = maxim;
for (int i = 2; i <= n + 1; i++)
{
if (max(v[i].l - l[i - 1], 0) == maxim)
{
ap_maxim --;
}
if (max (v[i - 1].l - l[i - 1], 0) > maxim)
{
maxim = max (v[i - 1].l - l[i - 1], 0);
ap_maxim = 1;
}
else if (max (v[i - 1].l - l[i - 1], 0) == maxim)
ap_maxim ++;
maxim_in_stanga [i - 1].maxim = maxim_in_stanga[i - 2].maxim;
maxim_in_stanga[i - 1].ap = maxim_in_stanga[i - 2].ap;
if (maxim_in_stanga[i - 1].maxim < max (v[i - 1].l - l[i - 1], 0))
{
maxim_in_stanga[i - 1].maxim = max (v[i - 1].l - l[i - 1], 0);
maxim_in_stanga[i - 1].ap = 1;
}
else if (maxim_in_stanga[i - 1].maxim == max (v[i - 1].l - l[i - 1], 0))
maxim_in_stanga[i - 1].ap ++;
if (ap_maxim == 0)
{
//cout << "abecedar" << ' ' << i << ' ';
maxim = -1;
/**for (int j = 1; j < i; j++)
{
if (max(v[j].l - l[j], 0) > maxim)
{
maxim = max(v[j].l - l[j], 0);
ap_maxim = 1;
}
else if (max(v[j].l - l[j], 0) == maxim)
ap_maxim ++;
}*/
maxim = maxim_in_stanga[i - 1].maxim;
ap_maxim = maxim_in_stanga[i - 1].ap;
//cout << maxim << ' ' << ap_maxim << '\n';
if (i != n + 1 && maxim_in_dreapta[i].maxim > maxim)
{
maxim = maxim_in_dreapta[i].maxim;
ap_maxim = maxim_in_dreapta[i].ap;
}
/**for (int j = i; j <= n; j++)
{
if (max(v[j + 1].l - l[j], 0) > maxim)
{
maxim = max(v[j + 1].l - l[j], 0);
ap_maxim = 1;
}
else if (max(v[j + 1].l - l[j], 0) == maxim)
ap_maxim ++;
}*/
}
raspuns[v[i].indice] = maxim;
}
for (int i = 1; i <= n + 1; i++)
cout << raspuns[i] << ' ';
return 0;
}
