#include "bits/stdc++.h"

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl

typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i,n) for(ll i=1;i<=(ll)(n);i++)
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define rrep1(i,n) for(ll i=(ll)(n);i>0;i--)
#define REP(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
const ll inf = 1000000001;
const ll INF = 2e18;
const ll MOD = 1000000007;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);

typedef complex<double> P;

vector<P> fft(vector<P> v, bool rev = false) {
	int n = v.size(), i, j, m;

	for (i = 0, j = 1; j<n - 1; j++) {
		for (int k = n >> 1; k>(i ^= k); k >>= 1);
		if (i>j) swap(v[i], v[j]);
	}
	for (int m = 2; m <= n; m *= 2) {
		double deg = (rev ? -1 : 1) * 2 * acos(-1) / m;
		P wr(cos(deg), sin(deg));
		for (i = 0; i<n; i += m) {
			P w(1, 0);
			for (int j1 = i, j2 = i + m / 2; j2<i + m; j1++, j2++) {
				P t1 = v[j1], t2 = w*v[j2];
				v[j1] = t1 + t2, v[j2] = t1 - t2;
				w *= wr;
			}
		}
	}
	if (rev) rep(i, n) v[i] *= 1.0 / n;
	return v;
}

vector<P> MultPoly(vector<P> a, vector<P> b) {
	a = fft(a), b = fft(b);
	for (int i = 0; i<a.size(); i++) a[i] *= b[i];
	return fft(a, true);
}



int main(){
  int l, m, n;
  cin >> l >> m >> n;
  ll x = n;
  while (x&(x - 1)) x++;
  x *= 4;
  vector<P> a(x), b(x);
  rep (i, l) {
    int temp;
    cin >> temp;
    temp--;
    a[temp].real(1);
  }
  rep (i, m) {
    int temp;
    cin >> temp;
    temp--;
    b[n - temp].real(1);
  }
  auto ans = MultPoly(a, b);
  int q;
  cin >> q;
  REP(i, n, n + q) {
    cout << (int)(ans[i].real() + 0.5) << endl;
  }
}