#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
#include <sstream>
 
#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 main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(16);//
	
	vector<int> A,B;
	vector<PII> Avar,Bvar;
	int L,M,N;
	cin>>L>>M>>N;
	
	A.resize(L);
	B.resize(M);
	rep(i,L){
		cin>>A[i];
	}
	rep(i,M){
		cin>>B[i];
	}
	sort( A.begin(), A.end() );
	sort( B.begin(), B.end() );
	int AmaxVar = A.back();
	///////////
	Avar.reserve(L);
	Bvar.reserve(M);
	
	int f=-1,b=-1;
	rep(i,L){
		if(b+1==A[i]){
			b = A[i];
		}else{
			if(f!=-1){
				Avar.push_back( PII(f,b) );
			}
			f = A[i];
			b = A[i];
		}
	}
	Avar.push_back( PII(f,b) );
	
	f=-1;
	b=-1;
	rep(i,M){
		if(b+1==B[i]){
			b = B[i];
		}else{
			if(f!=-1){
				Bvar.push_back( PII(f,b) );
			}
			f = B[i];
			b = B[i];
		}
	}
	Bvar.push_back( PII(f,b) );
	///////////
	vector<PII>::iterator Aitr,Bitr,Aend,Bend;
	Aend = Avar.end();
	Bend = Bvar.end();

	int Q,ans=0;
	int A_first,A_second,B_first,B_second;
	int As_Bf,Bs_Af;
	cin>>Q;
	stringstream  ansSS;
	rep(i,Q){
		ans=0;
		Aitr = Avar.begin();
		Bitr = Bvar.begin();
		while( Aitr != Aend && Bitr != Bend ){

			A_first		= Aitr->first;
			A_second	= Aitr->second;
			B_first		= Bitr->first + i;
			B_second	= Bitr->second + i;

			As_Bf = Aitr->second - (Bitr->first + i);
			Bs_Af = (Bitr->second + i) - Aitr->first;
			if( B_first > AmaxVar ){
				break;
			}
			else if( As_Bf < 0 ){
				++Aitr;
			}
			else if( Bs_Af < 0){
				++Bitr;
			}
			else if( 0 <= B_first - A_first ){
				if( 0 <= B_second - A_second ){
					ans += As_Bf + 1;
					++Aitr;
				}else{
					ans += B_second - B_first + 1;
					++Bitr;
				}
			}else{
				if( 0 <= A_second - B_second ){
					ans += Bs_Af + 1;
					++Bitr;
				}else{
					ans += A_second - A_first + 1;
					++Aitr;
				}
			}
		}
		ansSS << ans << '\n';
	}
	cout << ansSS.str();
	return 0;
}