#include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

using C = complex<double>;
double pi = acos(-1.0);

void FFT(vector<C> & A, bool inv) {
    int N = A.size();
    for (int i = 0, j = 0; j < N; j++) {
        if (i < j) swap(A[i], A[j]);
        for (int k = N >> 1; k > (i ^= k); k >>= 1);
    }
    for (int i = 1; i < N; i <<= 1) {
        C q = C(cos(pi / i), sin(pi / i) * (inv ? 1.0 : -1.0));
        C qj = C(1.0, 0.0);
        rep(j, i) {
            for (int k = j; k < N; k += i * 2) {
                C l = A[k], r = A[k + i] * qj;
                A[k] = l + r;
                A[k + i] = l - r;
            }
            qj *= q;
        }
    }
    if (inv) rep(i, N) A[i] /= N;
}

vector<C> CONV(const vector<C> & A, const vector<C> & B) {
    int Z = 1; while (Z < A.size() + B.size()) Z <<= 1;
    vector<C> Ax(Z), Bx(Z);
    rep(i, Z) Ax[i] = Bx[i] = 0;
    rep(i, A.size()) Ax[i] = A[i];
    rep(i, B.size()) Bx[i] = B[i];
    FFT(Ax, false);
    FFT(Bx, false);
    rep(i, Z) Ax[i] *= Bx[i];
    FFT(Ax, true);
    return move(Ax);
}

int main() {
    int L, M, N; cin >> L >> M >> N;
    vector<C> A(N, C(0., 0.)), B(N, C(0., 0.));
    rep(i, L) { int a; cin >> a; A[a - 1] += C(1., 0.); }
    rep(i, M) { int a; cin >> a; B[N - a] += C(1., 0.); }
    vector<C> X = CONV(A, B);
    int Q; cin >> Q;
    rep(i, Q) cout << int(X[N + i - 1].real() + 0.5) << endl;
    return 0;
}