#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, m; cin >> n >> m;
  vector<int> a(n), b(m);
  REP(i, n) cin >> a[i];
  REP(i, m) cin >> b[i];
  const auto compare = [&](const pair<int, int>& x, const pair<int, int>& y) -> bool {
    const auto [xi, xj] = x;
    const auto [yi, yj] = y;
    if (1LL * a[xi] * b[yj] != 1LL * a[yi] * b[xj]) {
      return 1LL * a[xi] * b[yj] < 1LL * a[yi] * b[xj];
    }
    return xi > yi;
  };
  priority_queue<pair<int, int>, vector<pair<int, int>>, decltype(compare)> que{compare};
  REP(i, n) que.emplace(i, 0);
  REP(_, m) {
    const auto [i, j] = que.top(); que.pop();
    cout << i + 1 << '\n';
    if (j + 1 < m) que.emplace(i, j + 1);
  }
  return 0;
}