#include <bits/stdc++.h>
using namespace std;
#define MAXN 150000
typedef long long ll;
typedef pair<int,int> pii;

ll n,m,a[MAXN],x[MAXN];

bool pos(int v,int i) {return (a[i] - (v + 1) >= x[v]);}
ll bin_search(int ind)
{
    int l = 0, r = m;
    while(l < r)
    {
        if(r - l == 1)
            return (pos(r,ind) ? r + 1 : l + 1);
        int mid = (l + r) >> 1;
        if(pos(mid,ind))
            l = mid;
        else
            r = mid;
    }
    return l + 1;
}


int main()
{
    cin >> n;
    for(int i = 0; i < n; i++)
        cin >> a[i];
    cin >> m;
    for(int i = 0; i < m; i++)
        cin >> x[i];
    sort(x, x + m);

    for(int i = 0; i < n; i++)
        a[i] -= bin_search(i);
    for(int i = 0; i < n; i++)
        cout << a[i] << " ";
    cout << endl;
    return 0;
}