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

int main() {
    int L, M, N; cin >> L >> M >> N;
    bitset<100000> as, bs;
    for (int i = 0; i < L; i++) {
        int a; cin >> a;
        as[a - 1] = 1;
    }
    for (int i = 0; i < M; i++) {
        int b; cin >> b;
        bs[b - 1] = 1;
    }
    int q; cin >> q;
    for (int i = 0; i < q; i++) {
        cout << (as & bs << i).count() << endl;
    }
	return 0;
}