Ближайшее число

N, K = map(int, input().split())
P = [int(i) for i in input().split()]
V = list(map(int, input().split()))
a = []
 
 
for i in range(len(a)):
    if a[i] < n:
        find_num = -find_num
    else:
        find_num = find_num + 0
    if a[i] >= n and a[i] - n <= find_num - n:
        find_num = a[i]
    elif a[i] <= n and find_num - n <= a[i] - n:
        find_num = a[i]
 
 
print(P)

from bisect import bisect_left
n, k = map(int, input().split())
num = list(map(int, input().split()))
que = list(map(int, input().split()))
for d in que:
    ind = bisect_left(num, d)
    if ind == 0:
        print(num[ind])
    elif ind == n:
        print(num[ind-1])
    else:
        print(num[ind] 
            if num[ind] - d < d - num[ind-1]
             else num[ind-1])

#from bisect import bisect_left
 
def bin_search(a, x, n):
    
    L = -1
    R = n    
    
    while R - L > 1:
        
        mid = (R + L) // 2
        
        if a[mid] < x:
            L = mid
        else:
            R = mid
            
    return L
    
n, k = map(int, input().split())
num = list(map(int, input().split()))
que = list(map(int, input().split()))
for d in que:
    #ind = bisect_left(num, d)
    
    ind = bin_search(num, d, n)
 
    if ind == -1:
        print(num[0])
    elif ind == n:
        print(num[ind-1])
    else:
        print(num[ind] 
            if num[ind] - d < d - num[ind-1]
             else num[ind-1])