#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

struct Node {
  int i;
  int cnt;
  int a;
  int b;
  double value;

  Node(int i = -1, int cnt = -1, int a = 0, int b = 0) {
    this->i = i;
    this->cnt = cnt;
    this->a = a;
    this->b = b;
    this->value = a * 1.0 / b;
  }

  bool operator>(const Node &n) const {
    if (value == n.value) {
      return i > n.i;
    } else {
      return value < n.value;
    }
  }
};

int main() {
  int N, M;
  cin >> N >> M;

  vector<int> A(N);
  for (int i = 0; i < N; ++i) {
    cin >> A[i];
  }

  vector<int> B(N);
  for (int i = 0; i < M; ++i) {
    cin >> B[i];
  }

  priority_queue <Node, vector<Node>, greater<Node>> pque;
  for (int i = 0; i < N; ++i) {
    pque.push(Node(i, 1, A[i], B[0]));
  }

  vector<int> counter(N, 0);

  for (int i = 0; i < M; ++i) {
    Node node = pque.top();
    pque.pop();

    cout << node.i + 1 << endl;
    counter[node.i]++;

    if (counter[node.i] < M) {
      node.b = B[counter[node.i]];
      node.value = node.a * 1.0 / node.b;
      pque.push(node);
    }
  }

  return 0;
}