#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>
#include <climits>
#include <numeric>
#include <functional>
#include <time.h>
#include <bitset>

using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)a; i <= (int)b; i++)
template<class T> void checkmin(T &a, T b) { if (b < a) a = b; }
template<class T> void checkmax(T &a, T b) { if (b > a) a = b; }


const int MaxN = 100000;
int NA, NB, N, Q, A[MaxN], B[MaxN];

void solve() {
    sort(A, A + NA);
    sort(B, B + NB);
    bitset<MaxN> bitA, bitB;
    rep(i, NA) bitA.set(A[i] - 1);
    rep(i, NB) bitB.set(B[i] - 1);
    rep(add, Q) {
        int ans = (bitA & (bitB << add)).count();
        printf("%d\n", ans);
    }
}

int main() {
    scanf("%d%d%d", &NA, &NB, &N);
    rep(i, NA) scanf("%d", &A[i]);
    rep(i, NB) scanf("%d", &B[i]);
    scanf("%d", &Q);
    solve();
    return 0;
}