package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

func out(x ...interface{}) {
	fmt.Println(x...)
}

var sc = bufio.NewScanner(os.Stdin)

func getInt() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getInts(N int) []int {
	ret := make([]int, N)
	for i := 0; i < N; i++ {
		ret[i] = getInt()
	}
	return ret
}

func getString() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func lowerBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] >= x
	})
	return idx
}

func upperBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] > x
	})
	return idx
}

func main() {
	sc.Split(bufio.ScanWords)
	L, M, N := getInt(), getInt(), getInt()
	a := make([]bool, N+1)
	b := make([]bool, N+1)
	for i := 0; i < L; i++ {
		a[getInt()] = true
	}
	for i := 0; i < M; i++ {
		b[getInt()] = true
	}

	w := bufio.NewWriter(os.Stdout)
	defer w.Flush()

	Q := getInt()
	for i := 0; i < Q; i++ {
		cnt := 0
		for j, k := i, 0; j <= N; j++ {
			if a[j] == true && b[k] == true {
				cnt++
			}
			k++
		}
		fmt.Fprintln(w, cnt)
	}
}