#include <iostream>
#include <vector>
#include <cmath>
using namespace std;

template<class T> struct complex {
    T real, imag;
    inline complex& operator=(const complex<T> &c) {real = c.real; imag = c.imag; return *this;}
    friend inline ostream& operator<<(ostream &s, const complex<T> &c) {return s<<'<'<<c.real<<','<<c.imag<<'>';}
};
template<class T> complex<T> make_comp(T a, T b) {
    complex<T> res = {a, b}; return res;
}
template<class T> complex<T> operator + (const complex<T> &x, const complex<T> &y) {
    complex<T> res = {x.real + y.real, x.imag + y.imag}; return res;
}
template<class T> complex<T> operator - (const complex<T> &x, const complex<T> &y) {
    complex<T> res = {x.real - y.real, x.imag - y.imag}; return res;
}
template<class T> complex<T> operator * (const complex<T> &x, const complex<T> &y) {
    complex<T> res = {x.real * y.real - x.imag * y.imag, x.real * y.imag + x.imag * y.real}; return res;
}
template<class T1, class T2> complex<T1> operator * (const complex<T1> &x, T2 a) {
    complex<T1> res = {x.real * a, x.imag * a}; return res;
}
template<class T1, class T2> complex<T1> operator / (const complex<T1> &x, T2 a) {
    complex<T1> res = {x.real / a, x.imag / a}; return res;
}


const int MAX = 1<<20;
long long A[MAX], B[MAX], C[MAX];
complex<double> AT[MAX], BT[MAX], CT[MAX];

void FFT(complex<double> F[], bool inv) {
    int N = MAX;
    for (int t = N; t >= 2; t >>= 1) {
        double ang = acos(-1.0)*2/t;
        for (int i = 0; i < t/2; i++) {
            complex<double> w = {cos(ang*i), sin(ang*i)};
            if (inv) w.imag = -w.imag;
            for (int j = i; j < N; j += t) {
                complex<double> f1 = F[j] + F[j+t/2];
                complex<double> f2 = (F[j] - F[j+t/2]) * w;
                F[j] = f1;
                F[j+t/2] = f2;
            }
        }
    }
    for (int i = 1, j = 0; i < N; i++) {
        for (int k = N >> 1; k > (j ^= k); k >>= 1);
        if (i < j) swap(F[i], F[j]);
    }
}

void mult() {
    for (int i = 0; i < MAX; ++i) AT[i] = make_comp((double)A[i], 0.0);
    for (int i = 0; i < MAX; ++i) BT[i] = make_comp((double)B[i], 0.0);
    
    FFT(AT, false);
    FFT(BT, false);
    
    for (int i = 0; i < MAX; ++i) CT[i] = AT[i] * BT[i];
    
    FFT(CT, true);
    
    for (int i = 0; i < MAX; ++i) {
        CT[i] = CT[i] / MAX;
        C[i] = (long long)(CT[i].real + 0.5);
    }
}




int main() {
    int L, M, N, Q;
    cin >> L >> M >> N;
    for (int i = 0; i < L; ++i) {
        int a; cin >> a; A[a-1] = 1;
    }
    for (int i = 0; i < M; ++i) {
        int b; cin >> b; B[N-b] = 1;
    }
    mult();
    
    cin >> Q;
    for (int i = 0; i < Q; ++i) {
        cout << C[N-1+i] << endl;
    }
}