import bisect

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    ptr = 0
    L = int(data[ptr])
    ptr += 1
    M = int(data[ptr])
    ptr += 1
    N = int(data[ptr])
    ptr += 1
    
    A = list(map(int, data[ptr:ptr+L]))
    ptr += L
    B = list(map(int, data[ptr:ptr+M]))
    ptr += M
    Q = int(data[ptr])
    ptr += 1
    
    B.sort()
    diff = [0] * (Q + 2)
    
    for a in A:
        b_min = a - (Q - 1)
        b_max = a
        left = bisect.bisect_left(B, b_min)
        right = bisect.bisect_right(B, b_max)
        if right > left:
            v_start = a - B[right - 1]
            v_end = a - B[left]
            v_start = max(v_start, 0)
            v_end = min(v_end, Q - 1)
            if v_start > v_end:
                continue
            diff[v_start] += 1
            if v_end + 1 <= Q:
                diff[v_end + 1] -= 1
    
    current = 0
    result = []
    for v in range(Q):
        current += diff[v]
        result.append(current)
    
    print('\n'.join(map(str, result)))

if __name__ == "__main__":
    main()