from heapq import heappop, heappush n, m = map(int, input().split()) A = list(map(int, input().split())) B = list(map(int, input().split())) H = [] for i in range(n): heappush(H, (-A[i] / 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] / B[idx], ans, idx))