#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
#include <unordered_set>
#include <set>

#define REP(i, n) for(int i=0;i<(n);i++)

using namespace std;


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int L, M, N;
    cin >> L >> M >> N;

    vector<int> A(L);
    REP(i, L) {
        cin >> A[i];
    }

    vector<int> B(M);
    REP(i, M) {
        cin >> B[i];
    }
    int Q;
    cin >> Q;

    multiset<int> C;
    for (int a: A) {
        for (int b: B) {
            C.insert(a - b);
        }
    }

    REP(i, Q) {
        cout << C.count(i) << endl;
    }

    return 0;
}