#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define fix(x) fixed << setprecision(x)
#define asc(x) x, vector<x>, greater<x>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m;
    cin >> n >> m;
    vector<ll> a(n), b(m+1,INF);
    rep(i,n) cin >> a[i];
    rep(i,m) cin >> b[i];
    auto compare = [&](P x, P y){
        ll p = a[x.first] * b[y.second], q = a[y.first] * b[x.second];
        if(p!=q) return p < q;
        return x.first > y.first;
    };
    priority_queue<P,vector<P>,decltype(compare)> pq{compare};
    rep(i,n) pq.push({i,0});
    rep(i,m){
        int x,y;
        tie(x,y) = pq.top();
        pq.pop();
        cout << x+1 << "\n";
        pq.push({x,y+1});
    }
    return 0;
}