import java.util.*;

class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        
        int N = sc.nextInt();
        int M = sc.nextInt();
        
        int[] A = new int[N];
        int[] B = new int[M];
        
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
        }
        
        for (int i = 0; i < M; i++) {
            B[i] = sc.nextInt();
        }
        
        PriorityQueue<Candidate> pq = new PriorityQueue<>();
        
        for (int i = 0; i < N; i++) {
            pq.add(new Candidate(A[i], B[0], i + 1, 0));
        }
        
        for (int i = 0; i < M; i++) {
            Candidate winner = pq.poll();
            System.out.println(winner.party);
            
            int nextIndex = winner.index + 1;
            if (nextIndex < M) {
                pq.add(new Candidate(A[winner.party - 1], B[nextIndex], winner.party, nextIndex));
            }
        }
    }
    
    static class Candidate implements Comparable<Candidate> {
        int numerator;
        int denominator;
        int party;
        int index;
        
        Candidate(int numerator, int denominator, int party, int index) {
            this.numerator = numerator;
            this.denominator = denominator;
            this.party = party;
            this.index = index;
        }
        
        @Override
        public int compareTo(Candidate o) {
            long x = (long) this.numerator * o.denominator;
            long y = (long) o.numerator * this.denominator;
            if (x != y) {
                return Long.compare(y, x);
            }
            return Integer.compare(this.party, o.party);
        }
    }
}