def searchInsertK(arr, k):  
    left, right = 0, len(arr) - 1  
    while left <= right:  
        mid = left + (right - left) // 2  
        if arr[mid] == k:  
            return mid  
        elif arr[mid] > k:  
            right = mid - 1  
        else:  
            left = mid + 1  
    return right  


n, q = map(int, input().split())
t = tuple(map(int, input().split()))
m = tuple(int(input()) for _ in range(q))

maxti = 0
maxt = list()

for i in range(n):
    if maxti < t[i]:
        maxti = t[i]
    maxt.append(maxti)

for i in range(q):
    print(searchInsertK(maxt, m[i]+0.5) + 2)