import bisect

def main():
    import sys
    input = sys.stdin.read().split()
    ptr = 0
    L, M, N = map(int, input[ptr:ptr+3])
    ptr +=3
    A = list(map(int, input[ptr:ptr+L]))
    ptr += L
    B = list(map(int, input[ptr:ptr+M]))
    ptr += M
    Q = int(input[ptr])
    ptr +=1

    A.sort()
    counter = [0] * Q

    for b in B:
        lower = b
        upper = b + Q - 1
        left = bisect.bisect_left(A, lower)
        right = bisect.bisect_right(A, upper)
        for a in A[left:right]:
            v = a - b
            counter[v] += 1

    for cnt in counter:
        print(cnt)

if __name__ == "__main__":
    main()