import bisect

def main():
    import sys
    input = sys.stdin.read().split()
    ptr = 0
    L = int(input[ptr]); ptr += 1
    M = int(input[ptr]); ptr += 1
    N = int(input[ptr]); ptr += 1
    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()
    B.sort()

    ans = [0] * Q

    for x in A:
        lower = x - (Q - 1)
        upper = x
        left = bisect.bisect_left(B, lower)
        right = bisect.bisect_right(B, upper)
        for i in range(left, right):
            b = B[i]
            v = x - b
            if 0 <= v < Q:
                ans[v] += 1

    for a in ans:
        print(a)

if __name__ == '__main__':
    main()