#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#include<bitset>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<fstream>
#include<iomanip>
#include<ctime>
#include<complex>
#include<functional>
#include<climits>
#include<cassert>
#include<iterator>
using namespace std;
int l, m, n;
#define MAX 100002
vector<int> a;
vector<int> b;
int ans[MAX];
int main(){
	scanf("%d%d%d", &l, &m, &n);
	a.resize(l);
	for (int i = 0; i < l; i++){
		scanf("%d", &a[i]);
	}
	b.resize(m);
	for (int j = 0; j < m; j++){
		scanf("%d", &b[j]);
	}
	sort(a.begin(), a.end());
	sort(b.begin(), b.end());
	for (int i = 0; i < b.size(); i++){
		int ind = lower_bound(a.begin(), a.end(), b[i]) - a.begin();
		for (int j = ind; j < a.size(); j++){
			ans[abs(a[j] - b[i])]++;
		}
	}
	int q;
	scanf("%d", &q);
	for (int i = 0; i < q; i++){
		printf("%d\n", ans[i]);
	}
	return 0;
}