import java.io.*;
import java.util.*;
import java.util.stream.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int l = sc.nextInt();
        int m = sc.nextInt();
        int n = sc.nextInt();
        BitSet.length = n + 1;
        BitSet base = new BitSet();
        for (int i = 0; i < l; i++) {
            base.add(sc.nextInt());
        }
        BitSet target = new BitSet();
        for (int i = 0; i < m; i++) {
            target.add(sc.nextInt());
        }
        int q = sc.nextInt();
        int[] ans = new int[q];
        for (int i = 0; i < 60 && i < q; i++) {
            for (int j = 0; j < (q + 59) / 60; j++) {
                if (j * 60 + i >= q) {
                    break;
                }
                ans[j * 60 + i] = base.getCount(j, target);
            }
            target.shift();
        }
        System.out.println(String.join("\n", Arrays.stream(ans).mapToObj(String::valueOf).toArray(String[]::new)));
    }
    
    static class BitSet {
        static int length;
        int size;
        long[] values;
        static final long MASK = (1L << 60) - 1;
        
        public BitSet() {
            size = (length + 59) / 60;
            values = new long[size];
        }
        
        public void add(int x) {
            values[x / 60] |= (1L << (x % 60));
        }
        
        public int getCount(int diff, BitSet bs) {
            int count = 0;
            for (int i = 0; i + diff < size; i++) {
                count += getPop(bs.values[diff + i] & values[i]);
            }
            return count;
        }
        
        private int getPop(long x) {
            long pop = 0;
            while (x > 0) {
                pop += x % 2;
                x >>= 1;
            }
            return (int)pop;
        }
        
        public void shift() {
            long add = 0;
            for (int i = 0; i < size; i++) {
                values[i] <<= 1;
                values[i] += add;
                if ((values[i] & (1L << 60)) == 0) {
                    add = 0;
                } else {
                    values[i] ^= (1L << 60);
                    add = 1;
                }
            }
        }
        
    }
}
class Utilities {
    static String arrayToLineString(Object[] arr) {
        return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
    }
    
    static String arrayToLineString(int[] arr) {
        return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public int[] nextIntArray() throws Exception {
        return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
    }
    
    public String next() throws Exception {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
    
}