// REgri-La Shower

#include <cstdio>

int L, M, N;
int A[100000], B[100000];
int counter[200010];
int Q;

int main(){
    scanf("%d %d %d", &L, &M, &N);

    for(int i=0;i<L;i++){
        int a;
        scanf("%d", &a);
        ++A[--a];
    }

    for(int i=0;i<M;i++){
        int b;
        scanf("%d", &b);
        ++B[--b];
    }

    int v, next, t;
    for(int i=0,j;i<N;){
        while(i < N && B[i] == 0){++i;}
        if(i == N){break;}
        
        j = i;
        
        v = 0;
        while(j < N && B[j] == 1){
            v += A[j++];
        }
        counter[0] += v;

        next = j;
        t = 1;
        while(j < 2*N){
            v += A[j++] - A[i++];
            counter[t++] += v;
        }

        i = next;
    }

    scanf("%d", &Q);
    for(int i=0;i<Q;i++){
        printf("%d\n", counter[i]);
    }
}