#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <numeric>
#include <bitset>
#define rep(x, to) for (int x = 0; x < (to); x++)
#define REP(x, a, to) for (int x = (a); x < (to); x++)
#define foreach(itr, x) for (typeof((x).begin()) itr = (x).begin(); itr != (x).end(); itr++)

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;

int L, M, N;
int A[100005];
int B[100005];
int Q;

int solve() {
	bitset<200005> bit_a;
	bitset<200005> bit_b;
	rep(i, L) bit_a.set(A[i]);
	rep(i, M) bit_b.set(B[i]);
	rep(i, Q) {
		bitset<200005> bit_c = bit_a & (bit_b << i);
		cout << bit_c.count() << endl;
	}
}


int main() {
	cin >> L >> M >> N;
	rep(i, L) cin >> A[i];
	rep(i, M) cin >> B[i];
	cin >> Q;
	solve();
	return 0;
}