from heapq import heappush, heappop


class Frac:
    def __init__(self, num, den):
        self.num = -num
        self.den = den

    def __eq__(self, other):
        a = self.num * other.den
        b = other.num * self.den
        return a == b

    def __lt__(self, other):
        a = self.num * other.den
        b = other.num * self.den
        return a < b


N, M = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

B.sort()

q = []  # (score, a-index, b-index)
for i, a in enumerate(A):
    heappush(q, (Frac(a, B[0]), i, 0))

ans = []
for _ in range(M):
    x, a_index, b_index = heappop(q)
    # print(f'{x.num}/{x.den} {a_index=} {b_index=}')
    ans.append(a_index + 1)
    if b_index+1 < M:
        frac = Frac(A[a_index], B[b_index+1])
        heappush(q, (frac, a_index, b_index+1))

print(*ans, sep='\n')