#include <iostream>
#include <vector>
#include <cassert>
#include <cstring>
#include <cstdio>

using namespace std;
typedef long long ll;

namespace Karatsuba {
    template<class T>
    vector<T> naive_mul(vector<T> &a, vector<T> &b) {
        int n = (int)a.size();
        vector<T> res(2*n-1, 0);
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                res[i+j] += a[i]*b[j];
            }
        }
        return res;
    }

    template<class T>
    vector<T> mul(vector<T> &a, vector<T> &b) {
        assert(a.size() == b.size());
        int n = (int)a.size();
        if (n <= (1<<6)) {
            return naive_mul(a, b);//{a[0] * b[0]};
        }
        int m = n/2;
        auto A = vector<T>(a.begin()+m, a.end());
        auto B = vector<T>(a.begin(), a.begin()+m);
        auto C = vector<T>(b.begin()+m, b.end());
        auto D = vector<T>(b.begin(), b.begin()+m);
        auto z2 = mul(B, D);
        auto z0 = mul(A, C);
        for (int i = 0; i < m; i++) {
            B[i] += A[i];
            D[i] += C[i];
        }
        auto z1 = mul(B, D);
        for (int i = 0; i < n-1; i++) {
            z1[i] -= (z0[i] + z2[i]);
        }
        auto res = vector<T>(2*n-1, 0);
        for (int i = 0; i < n-1; i++) {
            res[i] += z2[i];
            res[i+m] += z1[i];
            res[i+n] += z0[i];
        }
        return res;
    }
}

const int N = 1<<17;
vector<int> A(N, 0), B(N, 0);

int main() {
    int l, m, n;
    scanf("%d %d %d", &l, &m, &n);
    for (int i = 0; i < l; i++) {
        int a;
        scanf("%d", &a);
        A[N-a] = 1;
    }
    for (int i = 0; i < m; i++) {
        int b;
        scanf("%d", &b);
        B[b] = 1;
    }
    auto C = Karatsuba::mul(A, B);
    int q;
    scanf("%d", &q);
    for (int i = 0; i < q; i++) {
        printf("%d\n", C[N-i]);
    }
    return 0;
}