#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

vector<complex<double>> fft(vector<complex<double>> a, bool inverse = 0) {
    int n = a.size();
    int h = (int)log2(n);

    for (int i = 0; i < n; i++) {
        int j = 0;
        for (int k = 0; k < h; k++) j |= (i >> k & 1) << (h - 1 - k);
        if (i < j) swap(a[i], a[j]);
    }

    for (int b = 1; b < n; b *= 2) {
        for (int j = 0; j < b; j++) {
            complex<double> w = polar(1.0, (2 * M_PI) / (2 * b) * j * (inverse ? 1 : -1));
            for (int k = 0; k < n; k += b * 2) {
                complex<double> s = a[j + k];
                complex<double> t = a[j + k + b] * w;
                a[j + k] = s + t;
                a[j + k + b] = s - t;
            }
        }
    }
    if (inverse)
        for (int i = 0; i < n; i++) a[i] /= n;
    return a;
}
vector<complex<double>> ifft(vector<complex<double>> &a) { return fft(a, 1); }

vector<complex<double>> fft(vector<double> a, bool inverse = 0) {
    vector<complex<double>> a_complex(a.size());
    for (int i = 0; i < a.size(); i++) a_complex[i] = complex<double>(a[i], 0);
    return fft(a_complex, inverse);
}
vector<complex<double>> ifft(vector<double> a) {
    vector<complex<double>> a_complex(a.size());
    for (int i = 0; i < a.size(); i++) a_complex[i] = complex<double>(a[i], 0);
    return fft(a_complex, 1);
}

// 畳み込み : return v | v[k] = sum_{0<=j<=k}(a[j]b[k-j])
vector<double> convolve(vector<double> a, vector<double> b) {
    int s = a.size() + b.size() - 1;
    int t = 1;
    while (t < s) t *= 2;
    a.resize(t);
    b.resize(t);
    vector<complex<double>> A = fft(a);
    vector<complex<double>> B = fft(b);
    for (int i = 0; i < t; i++) {
        A[i] *= B[i];
    }
    A = ifft(A);
    for (int i = 0; i < A.size(); i++) a[i] = A[i].real();
    return a;
}

int main() {
    int l, m, n, q;
    cin >> l >> m >> n;
    vector<double> A(n + 1), B(n + 1);
    for (int i = 0; i < l; i++) {
        int x;
        cin >> x;
        A[x]++;
    }
    for (int i = 0; i < m; i++) {
        int x;
        cin >> x;
        B[n - x]++;
    }
    cin >> q;
    vector<double> ans = convolve(A, B);
    for (int i = 0; i < q; i++) {
        cout << (int)(ans[i + n] + 0.5) << endl;
    }
    return 0;
}