#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int A[10000];
int B[10000];

int L, M;
//int calc(vector<int> &A, vector<int> &B, int v)
int calc(int v)
{
    //int AN = (int)A.size(), BN = (int)B.size();
    int AN = L, BN = M;
    int ap = 0, bp = 0;
    int count = 0;
    while(ap<AN && bp<BN){
        if(A[ap]==B[bp]+v){
        // cout << "ap=" << ap << ",bp=" << bp << endl;
            ap++, bp++;
            count ++;
        }else if(A[ap]>B[bp]+v){
            bp++;
        }else{
            ap++;
        }
    }
    return count;
}
int main(void){
    // Here your code !
    int N;
    cin >> L >> M >> N;
    //vector<int> A, B;
    for(int l=0;l<L;l++){
        int val;
        cin >> val;
        A[l] = val;
        // A.push_back(val);
    }
    for(int m=0;m<M;m++){
        int val;
        cin >> val;
        B[m] = val;
        //B.push_back(val);
    }
    int Q;
    cin >> Q;
    sort(A, A+L);
    sort(B, B+M);
    for(int v=0;v<Q;v++){
        int ret = calc(v);
        cout << ret << endl;
    }
    return 0;
}