n, q = map(int, input().split())
t = tuple(map(int, input().split()))
m = sorted(list(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)
previous_i = 0
for mi in m:
    output = 1
    for i in range(n-1, previous_i-1, -1):
        if maxt[i] <= mi:
            output = i + 2
            previous_i = i
            print(output)
            break