#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
 
#include <algorithm>
#include <cmath>
 
#include <string>
//#include <array>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>
 
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////
const int nmax = 100000;
int A[nmax+1],B[nmax+1];
int ans[nmax];
int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(16);//
	
	int L,M,N;
	cin>>L>>M>>N;

	rep(i,L){
		cin>>A[i];
	}
	rep(i,M){
		cin>>B[i];
	}
	sort(A,A+L);
	sort(B,B+M);
	int Q;
	cin>>Q;
	for(int i=0;i<M;++i){
		for(int j=0;j<L;++j){
			if(B[i] > A[j]){
				continue;
			}else if( A[j] - B[i] < Q){
				++ans[ A[j] - B[i] ];
			}else{
				break;
			}
		}
	}
	rep(i,Q){
		cout << ans[i] << '\n';
	}
	return 0;
}