#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

struct S{
	ll si, bo, ind;
};

int main(){
	int n, m; cin >> n >> m;
	vector<int> id(n);
	vector<int> a(n);
	rep(i,0,n) cin >> a[i];
	vector<int> b(m);
	rep(i,0,m) cin >> b[i];
	vector<int> piv(n);
	
	priority_queue<S, vector<S>, function<bool(S,S)>> pq(
		[](S a, S b){
			ll v = a.si * b.bo - b.si * a.bo;
			if (v == 0){
				return a.ind > b.ind;
			}else{
				return v < 0;
			}
		}
	);

	rep(i,0,n){
		pq.push({a[i], b[0], i});
	}
	
	vector<int> ans;
	while((int)ans.size() < m){
		S x = pq.top();
		pq.pop();
		ans.push_back(x.ind);
		piv[x.ind]++;
		if (piv[x.ind] < m){
			pq.push({a[x.ind], b[piv[x.ind]], x.ind});
		}
	}

	rep(i,0,m){
		cout << ans[i] + 1 << '\n';
	}
}