def binary_search(nums, target)：

left, right = 0, len(nums) - 1

result = -1

while left <= right:
    mid = left + (right - left) // 2
    if nums[mid] == target:
        result = mid
        right = mid - 1
    elif nums[mid] < target:
        left = mid + 1     
    else:
        right = mid - 1
if result!= -1:
    return result + 1
return result

n, m = map(int, input().split())

a = list(map(int, input().split()))

b = list(map(int, input().split()))

d = 0

while d < m:

print(binary_search(a, b[d]))
d += 1