#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <complex>
#include <string>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#ifndef LOCAL
#define debug(x) ;
#else
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;

template <typename T1, typename T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &p) {
  out << "{" << p.first << ", " << p.second << "}";
  return out;
}

template <typename T>
ostream &operator<<(ostream &out, const vector<T> &v) {
  out << '{';
  for (const T &item : v) out << item << ", ";
  out << "\b\b}";
  return out;
}
#endif

#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 200010

/* Fast Fourier Transform */

namespace FFT {
  using C = complex<double>;

  void DFT(vector<C> &a, bool rev = false) {
    int N = a.size(), h = 0;
    //const double M_PI = acos(-1);

    for (int i = 0; 1 << i < N; i++) h++;
    for (int i = 0; i < N; i++) {
      int j = 0;
      for (int k = 0; k < h; k++)
        j |= (i >> k & 1) << (h - 1 - k);
      if (i < j) swap(a[i], a[j]);
    }

    for (int i = 1; i < N; i *= 2) {
      for (int j = 0; j < i; j++) {
        C w = polar(1.0, M_PI / i * (rev ? -1 : 1) * j);
        for (int k = 0; k < N; k += i*2) {
          C s = a[j+k], t = a[j+k+i] * w;
          a[j+k+0] = s + t;
          a[j+k+i] = s - t;
        }
      }
    }

    if (rev) for(C &v : a) v /= N;
  }

  vector<ll> conv(const vector<int> &a, const vector<int> &b) {
    int s = 1, t = a.size() + b.size() - 1;
    while(s < t) s *= 2;

    vector<C> F(s), G(s);
    for(int i = 0; i < a.size(); i++) F[i] = a[i];
    for(int i = 0; i < b.size(); i++) G[i] = b[i];
    DFT(F); DFT(G);

    for(int i = 0; i < s; i++) F[i] *= G[i];
    DFT(F, true);

    vector<ll> res(t);
    for(int i = 0; i < t; i++) res[i] = F[i].real() + 0.5; //round
    return res;
  }
};


int main(){
  int L, M, N, Q;
  int A, B;

  scanf("%d%d%d", &L, &M, &N);

  vector<int> a(N+1), b(N+1);

  for (int i=0; i<L; i++) {
    scanf("%d", &A);
    a[A]++;
  }

  for (int i=0; i<M; i++) {
    scanf("%d", &B);
    b[N-B]++;
  }

  auto res = FFT::conv(a, b);

  scanf("%d", &Q);

  for (int i=N; i<N+Q; i++)
    printf("%lld\n", res[i]);

  return 0;
}