#pragma region Macros
#include <bits/stdc++.h>
#include <immintrin.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define ll long long
#define OVERLOAD(e1, e2, e3, e4, NAME, ...) NAME
#define _rep1(i, n) for (long long i = 0; i < n; i++)
#define _rep2(i, a, b) for (long long i = a; i < b; ++i)
#define _rep3(i, a, b, t) \
    for (long long i = a; i * (t / abs(t)) < b * (t / abs(t)); i += t)
#define rep(...) OVERLOAD(__VA_ARGS__, _rep3, _rep2, _rep1, _)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define sz(x) (ll) x.size()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pcnt __builtin_popcountll
#define SORT(v) sort(all(v))
#define UNIQUE(v) \
    SORT(v);      \
    v.erase(unique(v.begin(), v.end()), v.end());
#define COPY(A, B) copy(all(A), B.begin());
#define REV(v) reverse(all(v))
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))

#ifdef LOCAL
#define dbg(x)                                \
    cout << __LINE__ << " : " << #x << " = "; \
    print(x);
#else
#define dbg(x) true
#endif

using namespace std;
template <typename T>
using vc = vector<T>;
template <typename T>
using vvc = vector<vc<T>>;
template <typename T>
using vvvc = vector<vvc<T>>;

template <typename T>
bool chmin(T &k, T m) {
    bool ret = k > m;
    k = min(k, m);
    return ret;
}
template <typename T>
bool chmax(T &k, T m) {
    bool ret = k < m;
    k = max(k, m);
    return ret;
}

template <typename T>
inline void print(const vector<T> &v, string s = " ") {
    for (ll i = 0; i < (ll)v.size(); i++)
        cout << v[i] << (i != (ll)v.size() - 1 ? s : "\n");
}
template <typename T, typename S>
inline void print(const pair<T, S> &p) {
    cout << p.first << " " << p.second << endl;
}
template <typename T>
inline void print(const T &x) {
    cout << x << "\n";
}
template <typename T, typename S>
inline void print(const vector<pair<T, S>> &v) {
    for (auto &&p : v) print(p);
}
void yes(bool a) { cout << (a ? "yes" : "no") << endl; }
void YES(bool a) { cout << (a ? "YES" : "NO") << endl; }
void Yes(bool a) { cout << (a ? "Yes" : "No") << endl; }
template <typename T>
T SUM(vc<T> As) {
    T ret = 0;
    for (T a : As) ret += a;
    return ret;
}

#pragma endregion

const ll INF = numeric_limits<long long>::max();

template <typename T>
struct Fraction {
    T num, den;
    Fraction(T a, T b) : num(a), den(b) {
        reduction();
        assert(den != 0);
        assert(den > 0);
        T inf = numeric_limits<T>::max();
        assert(abs(double(num) * den) < inf);
    }
    Fraction() : num(0), den(1) {}

    Fraction &operator+=(const Fraction &p) {
        num = (num * p.den + p.num * den);
        den = p.den * den;
        reduction();
        return *this;
    }
    Fraction &operator-=(const Fraction &p) {
        num = (num * p.den - p.num * den);
        den = p.den * den;
        reduction();
        return *this;
    }
    Fraction &operator*=(const Fraction &p) {
        num = num * p.num;
        den = den * p.den;
        reduction();
        return *this;
    }
    Fraction &operator/=(const Fraction &p) {
        num = num * p.den;
        den = den * p.num;
        reduction();
        return *this;
    }

    Fraction operator+(const Fraction &p) const { return Fraction(*this) += p; }
    Fraction operator-(const Fraction &p) const { return Fraction(*this) -= p; }
    Fraction operator*(const Fraction &p) const { return Fraction(*this) *= p; }
    Fraction operator/(const Fraction &p) const { return Fraction(*this) /= p; }

    bool operator>(const Fraction &p) const {
        return num * p.den > p.num * den;
    }
    bool operator<(const Fraction &p) const {
        return num * p.den < p.num * den;
    }
    bool operator>=(const Fraction &p) const {
        return num * p.den >= p.num * den;
    }
    bool operator<=(const Fraction &p) const {
        return num * p.den <= p.num * den;
    }
    bool operator==(const Fraction &p) const {
        return num * p.den == p.num * den;
    }

   private:
    void reduction() {
        // ここの処理重いよ！
        T g = gcd(abs(num), abs(den));
        num /= g;
        den /= g;
        if (den < 0) {
            den *= -1;
            num *= -1;
        }
    }
};

void solve() {
    ll N, M;
    cin >> N >> M;
    vc<ll> As(N), Bs(M);
    rep(i, N) cin >> As[i];
    rep(i, M) cin >> Bs[i];

    vc<ll> Aidx(N);
    priority_queue<pair<Fraction<ll>, ll>> que;
    rep(i, N) { que.push(mp(Fraction<ll>(As[i], Bs[0]), -i)); }
    rep(m, M) {
        auto [_, idx] = que.top();
        que.pop();
        idx *= -1;
        print(idx + 1);
        if (Aidx[idx] + 1 < M) {
            Aidx[idx]++;
            que.push(mp(Fraction<ll>(As[idx], Bs[Aidx[idx]]), -idx));
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    // ll T; cin >> T;
    // rep(_, T)

    solve();
}