import heapq

n,m=map(int,input().split())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
L=[(A[i],i) for i in range(n)]
L.sort(reverse=1,key=lambda x:x[0])

H=[(-L[0][0]/B[0],0,0)]
S=set()
ans=[]
for _ in range(min(m*n,10**5+n+1)):
  x,i,j=heapq.heappop(H)
  ans.append( (x,L[i][1]+1) )
  if i+1<n and (i+1,j) not in S:
    S.add((i+1,j))
    heapq.heappush(H,(-L[i+1][0]/B[j],i+1,j))
  if j+1<m and (i,j+1) not in S:
    S.add((i,j+1))
    heapq.heappush(H,(-L[i][0]/B[j+1],i,j+1))
    
ans.sort(key=lambda x:x[1])
ans.sort(key=lambda x:x[0])
for i in range(m):
  print(ans[i][1])