#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)

template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }

template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }

//改造
typedef long long int ll;
using ll = long long int;
using ull = long long unsigned int;
using Int = long long int;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 1000000007


//ここから編集する
namespace FastFourierTransform {
    using C = complex<double>;

    void DiscreteFourierTransform(vector<C> &F, bool rev) {
        const int N = (int) F.size();
        const double PI = (rev ? -1 : 1) * acos(-1);
        for (int i = 0, j = 1; j + 1 < N; j++) {
            for (int k = N >> 1; k > (i ^= k); k >>= 1);
            if (i > j) swap(F[i], F[j]);
        }
        C w, s, t;
        for (int i = 1; i < N; i <<= 1) {
            for (int k = 0; k < i; k++) {
                w = polar(1.0, PI / i * k);
                for (int j = 0; j < N; j += i * 2) {
                    s = F[j + k];
                    t = C(F[j + k + i].real() * w.real() - F[j + k + i].imag() * w.imag(),
                          F[j + k + i].real() * w.imag() + F[j + k + i].imag() * w.real());
                    F[j + k] = s + t, F[j + k + i] = s - t;
                }
            }
        }
        if (rev) for (int i = 0; i < N; i++) F[i] /= N;
    }

    vector<long long> Multiply(const vector<int> &A, const vector<int> &B) {
        int sz = 1;
        while (sz < A.size() + B.size() - 1) sz <<= 1;
        vector<C> F(sz), G(sz);
        for (int i = 0; i < A.size(); i++) F[i] = A[i];
        for (int i = 0; i < B.size(); i++) G[i] = B[i];
        DiscreteFourierTransform(F, false);
        DiscreteFourierTransform(G, false);
        for (int i = 0; i < sz; i++) F[i] *= G[i];
        DiscreteFourierTransform(F, true);
        vector<long long> X(A.size() + B.size() - 1);
        for (int i = 0; i < A.size() + B.size() - 1; i++) X[i] = F[i].real() + 0.5;
        return (X);
    }
};

class Solve {
public:
    void solve() {
        Int L, M, N;
        cin >> L >> M >> N;
        vector<int> A(N);
        vector<int> B(N);
        for (int i = 0; i < L; ++i) {
            Int tmp;
            cin >> tmp;
            tmp--;
            A[tmp]++;
        }

        for (int i = 0; i < M; ++i) {
            Int tmp;
            cin >> tmp;
            tmp--;
            B[tmp]++;
        }

        Int Q;
        cin >> Q;
        reverse(all(B));

        auto C = FastFourierTransform::Multiply(A, B);
        for (int i = N - 1; i <= N + Q - 2; ++i) {
            cout << C[i] << endl;
        }


    }
};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    Solve().solve();


    return 0;
}