#include <bits/stdc++.h>

using namespace std;
using ll = long long;

double fraction2(ll p, ll q){
    return (double) p / (double) q;
}

int main(){

    ll N, M, x, x2;
    double p2;
    cin >> N >> M;
    vector<ll> A(N), B(M+1);
    vector<ll> cnt2(N);
    for (int i=0; i<N; i++) cin >> A[i];
    for (int i=0; i<M; i++) cin >> B[i];
    priority_queue<pair<double, ll>> que2;

    for (int i=0; i<N; i++){
        que2.push({fraction2(A[i], 1), -i});
    }

    while(M){
        M--;
        tie(p2, x2) = que2.top();
        que2.pop();
        cnt2[-x2]++;
        cout << -x2+1 << endl;
        que2.push({fraction2(A[-x2], B[cnt2[-x2]]), x2});
    }

    return 0;
}