package main

import (
	"bufio"
	"fmt"
	"math/bits"
	"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()
	n := (N + 63) / 64
	a := make([]int, n)
	b := make([]int, n)
	for i := 0; i < L; i++ {
		v := getInt()
		pos := v / 64
		bit := 63 - v%64
		a[pos] |= 1 << bit
	}
	for i := 0; i < M; i++ {
		v := getInt()
		pos := v / 64
		bit := 63 - v%64
		b[pos] |= 1 << bit
	}

	// for i := 0; i < n; i++ {
	// 	fmt.Printf("%64.64b ", a[i])
	// }
	// out()
	// for i := 0; i < n; i++ {
	// 	fmt.Printf("%64.64b ", b[i])
	// }
	// out()

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

	Q := getInt()
	for i := 0; i < Q; i++ {
		cnt := 0
		pos := i / 64
		bit := i % 64
		pre := 0
		for j, k := pos, 0; j < n; j++ {
			y := (b[j] >> bit) | pre
			cnt += bits.OnesCount(uint(a[k] & y))
			pre = b[j] << (64 - bit)
		}
		out(cnt)
	}

}