#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
#define REP(i,m,n) for(int i = m; i < (int)(n); ++i)
#define rep(i,n) REP(i, 0, n)
//------------------------------------------------------

class FFT { //f*gを高速に求める
public:
    using C = complex<double>;
    vector<C> f, g;
    int s; //max(deg(f), deg(g))

    int decideSize(int n) {
        int m = 1 << (32 - __builtin_clz(2 * n - 2));
        //m >= n+1, m = 2^a となる最小のm
        s = n;
        f.resize(m);
        g.resize(m);
        return m;
    }

    void dft(vector<C> &fp, double inv = 1.0) {
        int n = fp.size();
        if (n == 1) return;
        vector<C> f0(n / 2), f1(n / 2);
        for (int i = 0; i * 2 < n; ++i) { //fpをf0とf1に分割
            f0[i] = fp[2 * i];
            f1[i] = fp[2 * i + 1];
        }
        dft(f0, inv);
        dft(f1, inv);
        C pow_zeta = 1, zeta = polar(1.0, inv * 2 * PI / n); //1のn乗根
        int m = n / 2 - 1;

        rep(i, n) {
            fp[i] = f0[i & m] + pow_zeta * f1[i & m];
            pow_zeta *= zeta;
        }
    }

    void inv_dft(vector<C> &f_) {
        dft(f_, -1.0);
        C n = C(f_.size());
        for (auto&& i : f_) i /= n;
    }

    vector<int> ans() {
        vector<int> fg(2 * s - 1); //f*g
        dft(f);
        dft(g);
        int m = decideSize(s);
        rep(i, m) f[i] *= g[i];
        inv_dft(f);
        rep(i, 2 * s - 1) fg[i] = (int) round(f[i].real());
        return fg;
    }
};

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

    int l, m, n;
    cin >> l >> m >> n;
    FFT d;
    d.decideSize(n + 1);
    vector<int> va(n + 1, 0), vb(n + 1, 0);

    rep(i, l) {
        int a;
        cin >> a;
        va[a]++;
    }

    rep(i, m) {
        int b;
        cin >> b;
        vb[n - b]++;
    }

    rep(i, n + 1) {
        d.f[i] = va[i];
        d.g[i] = vb[i];
    }

    int q;
    cin >> q;
    vector<int> ans = d.ans();

    rep(i, q) {
        cout << ans[n + i] << endl;
    }
    return 0;
}