#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;
int AvarF[nmax+1];
int AvarS[nmax+1];
int BvarF[nmax+1];
int BvarS[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){
				AvarF[Amax] = f;
				AvarS[Amax] = b;
				++Amax;
				f = -1;
				b = -1;
			}
		}
	}
	if(f!=-1){
		AvarF[Amax] = f;
		AvarS[Amax] = 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){
				BvarF[Bmax] = f;
				BvarS[Bmax] = b;
				++Bmax;
				f = -1;
				b = -1;
			}
		}
	}
	if(f!=-1){
		BvarF[Bmax] = f;
		BvarS[Bmax] = 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( AvarS[Aitr] < (BvarF[Bitr] + i) ){
				++Aitr;
			}else if( (BvarS[Bitr] + i) < AvarF[Aitr] ){
				++Bitr;
			}
			else{
				if(AvarF[Aitr] <= (BvarF[Bitr] + i) ){
					if(AvarS[Aitr] <= (BvarS[Bitr] + i) ){
						ans += AvarS[Aitr] - (BvarF[Bitr] + i) + 1;
						++Aitr;
					}else{
						//ans += (BvarS[Bitr] + i) - (BvarF[Bitr] + i) + 1;
						ans += BvarS[Bitr] - BvarF[Bitr] + 1;
						++Bitr;
					}
				}else{
					if( (BvarS[Bitr] + i) <= AvarS[Aitr]){
						ans += (BvarS[Bitr] + i) - AvarF[Aitr] + 1;
						++Bitr;
					}else{
						ans += AvarS[Aitr] - AvarF[Aitr] + 1;
						++Aitr;
					}
				}
			}
		}
		cout << ans << '\n';
	}
	return 0;
}