#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <ctime>
#include <complex>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 1020000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    rep(i,a.size()) cout << a[i] << " ";
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
ll pcount(ll x) {return __builtin_popcountll(x);}
//const int mod = 1e9 + 7;
const int mod = 998244353;

vector<complex<double>> fft(vector<complex<double>> a, bool inverse = false){
	int n = a.size();
	int h = 0;
	while((1<<h) < n) 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 b=1; b<n; b*=2){
		for(int j=0; j<b; j++){
			complex<double> w = polar(1.0, -(2*pi) / (2*b) * j * (inverse ? -1 : 1));
			for(int k=0; k<n; k+=b*2){
				complex<double> s = a[j+k];
				complex<double> t = a[j+k+b] * w;
				a[j+k] = s + t;
				a[j+k+b] = s - t;
			}
		}
	}
	if(inverse) for(int i=0; i<n; i++) a[i] /= n;

	return a;
}

vector<complex<double>> fft(vector<double> a, bool inverse = false){
	int n = a.size();
	vector<complex<double>> ret(n);
	for(int i=0; i<n; i++) ret[i] = complex<double>(a[i],0);
	return fft(ret, inverse); 
}

vector<double> convolve(vector<double> a, vector<double> b){
	int sz = a.size() + b.size() - 1;
	int p = 1;
	while(p < sz) p *= 2;
	a.resize(p);
	b.resize(p);
	vector<complex<double>> A = fft(a);
	vector<complex<double>> B = fft(b);

	for(int i=0; i<p; i++) A[i] *= B[i];
	A = fft(A, true);
	a.resize(sz);
	for(int i=0; i<sz; i++) a[i] = A[i].real();

	return a;
}

int main(){
	int l,m,n; scanf("%d%d%d",&l,&m,&n);
	vd a(n+1,0), b(n+1,0);
	rep(i,l){
		int d; scanf("%d",&d);
		a[d] += 1.0;
	}
	rep(i,m){
		int d; scanf("%d",&d);
		b[n-d] += 1.0;
	}
	int q; scanf("%d",&q);
	vd c = convolve(a,b);
	for(int i=n; i<n+q; i++){
		int ans = (int)(c[i] + 0.5);
		cout << ans << "\n";
	}
}