from heapq import heappop, heappush
from math import gcd

def lcm(a, b):
    return a * b // gcd(a, b)

n, m = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

lcm_ = 1
for i in range(m):
    lcm_ = lcm(lcm_, B[i])
H = []
for i in range(n):
    heappush(H, (-A[i] * (lcm_ // B[0]), i, 0))
for _ in range(m):
    _, ans, idx = heappop(H)
    print(ans + 1)
    idx += 1
    if idx == m:
        continue
    heappush(H, (-A[ans] * (lcm_ // B[idx]), ans, idx))