#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;
template<class T> void assign(V<T>& v, int n, const T& a = T()) { v.assign(n, a); }
template<class T, class... Args> void assign(V<T>& v, int n, const Args&... args) { v.resize(n); for (auto&& e : v) assign(e, args...); }


using R = double;
using C = complex<R>;
constexpr R pi = acos((R) -1);

void dft(V<C>& a, R theta) {
  int n = a.size();
  int j = 0;
  for (int i = 1; i < n; ++i) {
    int k = n >> 1;
    while (j >= k) j -= k, k >>= 1;
    j += k;
    if (i < j) swap(a[i], a[j]);
  }
  for (int k = 1; k < n; k <<= 1) {
    V<C> xi(k);
    for (int i = 0; i < k; ++i) xi[i] = polar<R>(1, i * theta);
    for (int i = 0; i < n; ++i) if (~i & k) {
      j = i + k;
      tie(a[i], a[j]) = make_pair(a[i] + a[j] * xi[i & k - 1], a[i] - a[j] * xi[i & k - 1]);
    }
    theta /= 2;
  }
}

void convolution(V<C>& a, V<C>& b) {
  int n = a.size(), m = b.size();
  n = 1 << __lg(2 * (n + m - 1) - 1);
  a.resize(n), b.resize(n);
  dft(a, pi), dft(b, pi);
  for (int i = 0; i < n; ++i) a[i] *= b[i];
  dft(a, -pi);
  for (int i = 0; i < n; ++i) a[i] /= n;
}

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  int l, m, n; cin >> l >> m >> n;
  V<C> a(n), b(n);
  for (int i = 0; i < l; ++i) {
    int x; cin >> x, --x;
    a[n - 1 - x] = C(1);
  }
  for (int i = 0; i < m; ++i) {
    int x; cin >> x, --x;
    b[x] = C(1);
  }
  convolution(a, b);
  int q; cin >> q;
  for (int i = 0; i < q; ++i) cout << (int) (real(a[n - 1 - i]) + 0.5) << '\n';
}