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
    
    B_sorted = sorted(B)
    cnt = [0] * Q
    
    for x in A:
        min_y = x - (Q - 1)
        max_y = x
        left = bisect.bisect_left(B_sorted, min_y)
        right = bisect.bisect_right(B_sorted, max_y)
        for y in B_sorted[left:right]:
            v = x - y
            if 0 <= v < Q:
                cnt[v] += 1
    
    for v in range(Q):
        print(cnt[v])

if __name__ == '__main__':
    main()