#include<iostream>
#include<queue>
#include<cassert>
using namespace std;
struct Rat{
	int a,b;//a/b
	bool operator<(const Rat&rhs)const{
		return (long)a*rhs.b<(long)rhs.a*b;//a/b<rhs.a/rhs.b
	}
};
int N,M;
int A[1<<17],B[1<<17];
int idx[1<<17];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin>>N>>M;
	for(int i=0;i<N;i++)cin>>A[i];
	for(int i=0;i<M;i++)cin>>B[i];
	priority_queue<pair<Rat,int> >Q;
	for(int i=0;i<N;i++)Q.push(make_pair(Rat{A[i],B[0]},-i));
	for(int j=0;j<M;j++)
	{
		int i=-Q.top().second;
		Q.pop();
		cout<<i+1<<"\n";
		idx[i]++;
		if(idx[i]<M)Q.push(make_pair(Rat{A[i],B[idx[i]]},-i));
	}
}