#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;
bool A[nmax+1],B[nmax+1];
int Amax=0,Bmax=0;
PII Avar[nmax+1];
PII Bvar[nmax+1];
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;
	int f=-1,b=-1;
	int temp;
	rep(i,L){
		cin>>temp;
		A[temp] = true;
	}
	rep(i,M){
		cin>>temp;
		B[temp] = true;
	}
	
	for(int i=1; i <= nmax; ++i){
		if(A[i]){
			if(f==-1){
				f = i;
				b = i;
			}else{
				++b;
			}
		}else{
			if(f!=-1){
				Avar[Amax] = PII(f,b);
				++Amax;
				f = -1;
				b = -1;
			}
		}
	}
	if(f!=-1){
		Avar[Amax] = PII(f,b);
		++Amax;
	}

	f=-1;
	b=-1;
	for(int i=1; i <= nmax; ++i){
		if(B[i]){
			if(f==-1){
				f = i;
				b = i;
			}else{
				++b;
			}
		}else{
			if(f!=-1){
				Bvar[Bmax] = PII(f,b);
				++Bmax;
				f = -1;
				b = -1;
			}
		}
	}
	if(f!=-1){
		Bvar[Bmax] = PII(f,b);
		++Bmax;
	}
	///////////
	//vector<PII>::iterator Aitr,Bitr;
	int Aitr=0;
	int Bitr=0;
	int Q,ans=0;
	cin>>Q;
	rep(i,Q){
		ans=0;
		Aitr = 0;
		Bitr = 0;
		while( Aitr < Amax && Bitr < Bmax ){
			if( Avar[Aitr].second < (Bvar[Bitr].first + i) ){
				++Aitr;
			}else if( (Bvar[Bitr].second + i) < Avar[Aitr].first){
				++Bitr;
			}
			else{
				if(Avar[Aitr].first <= (Bvar[Bitr].first + i) ){
					if(Avar[Aitr].second <= (Bvar[Bitr].second + i) ){
						ans += Avar[Aitr].second - (Bvar[Bitr].first + i) + 1;
						++Aitr;
					}else{
						ans += (Bvar[Bitr].second + i) - (Bvar[Bitr].first + i) + 1;
						++Bitr;
					}
				}else{
					if( (Bvar[Bitr].second + i) <= Avar[Aitr].second){
						ans += (Bvar[Bitr].second + i) - Avar[Aitr].first + 1;
						++Bitr;
					}else{
						ans += Avar[Aitr].second - Avar[Aitr].first + 1;
						++Aitr;
					}
				}
			}
		}
		cout << ans << '\n';
	}
	return 0;
}