#include <iostream>
#include <algorithm>
using namespace std;

int main(void)
{
    int a[100000];
    int b[100000];
    int c[100000] = {0};
    int l, m, n, q;
    cin >> l >> m >> n;
    for(int i = 0; i < l; i++)
        cin >> a[i];
    for(int i = 0; i < m; i++)
        cin >> b[i];
    cin >> q;
    sort(a, a + l);
    sort(b, b + m);
    int ii = 0, jj = 0;
    while(ii < l && jj < m) {
        int d = a[ii] - b[jj];
        if(d < 0)
            ii++;
        else if(d <= q) {
            int sj = jj;
            while(true) {
                if(d < 0)
                    break;
                c[d]++;
                if(sj + 1 >= m)
                    break;
                d = a[ii] - b[++sj];
            }
            ii++;
        }
        else
            jj++;
    }
    for(int i = 0; i < q; i++)
        cout << c[i] << endl;
    return 0;
}