#region Header
#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
from queue import PriorityQueue
import bisect
import heapq

def input():
    return sys.stdin.readline()[:-1]

sys.setrecursionlimit(1000000)
#endregion

# _INPUT = """# paste here...
# """
# sys.stdin = io.StringIO(_INPUT)


def main():
    L, M, N = map(int, input().split())
    A = sorted(list(map(int, input().split())))
    B = sorted(list(map(int, input().split())))
    Q = int(input())

    T = [0 for _ in range(Q)]
    for j in range(M):
        b = B[j]
        k1 = bisect.bisect_left(A, b)
        if k1 == L:
            continue
        k2 = bisect.bisect_right(A, b+(Q-1))
        for k in range(k1, k2):
            a = A[k]
            i = a - b
            T[i] += 1
    for i in range(Q):
        print(T[i])


if __name__ == '__main__':
    main()