#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 

typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    using P = tuple<ll,ll,int,int>; //(Ai, Bj, i, j)
    int N,M; cin >> N >> M;
    vector<ll> A(N), B(M);
    rep(i,N) cin >> A[i];
    rep(j,M) cin >> B[j];
    auto c = [&](P p, P q){
        auto [Ap, Bp, ip, jp] = p;
        auto [Aq, Bq, iq, jq] = q;
        auto res = Ap * Bq - Aq * Bp;
        if (res == 0){
            return (ip > iq);
        }
        else{
            return (res < 0);
        }
    };
    priority_queue<P, vector<P>, decltype(c)> pq(c);
    rep(i,N)pq.push(make_tuple(A[i], B[0], i, 0));
    int cnt = 0;
    while(cnt < M){
        cnt++;
        debug(pq);
        int i = get<2>(pq.top());
        int j = get<3>(pq.top());
        pq.pop();
        debug(i, j);
        cout << (i + 1) << endl;
        if (j < M - 1) {
            pq.push(make_tuple(A[i], B[j + 1], i, j + 1));
        }
    }
}