#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
struct Data {
	int idx;
	long long a;
	long long b;
	Data(int _idx = 0, long long _a = 0, long long _b = 0) :idx(_idx), a(_a), b(_b) {}
	bool operator<(const Data &tar) const {
		long long x = a * tar.b;
		long long y = b * tar.a;
		if (x != y)return x < y;
		return idx > tar.idx;
	}
};
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<long long>a(n);
	rep(i, n)cin >> a[i];
	vector<long long>b(m);
	rep(i, m)cin >> b[i];
	priority_queue<Data>pq;
	vector<int>memo(n, -1);
	auto add = [&](int i)->void {
		Data d;
		int idx = memo[i] + 1;
		if (idx < m) d = Data(i, a[i], b[idx]);
		else d = Data(i, 0, 1);
		memo[i] = idx;
		pq.push(d);
	};
	rep(i, n) add(i);
	int k = m;
	while (k--) {
		auto top = pq.top();
		pq.pop();
		cout << top.idx + 1 << endl;
		add(top.idx);
	}
	return 0;
}