#include <iostream>
#include <map>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn = 2e5 + 10;
const int INF = 2e9;

int n, m;
int hotel[maxn], room[maxn];
int segment_tree[3 * maxn];

int merge_nodes(int A, int B) {
    return max(A, B);
}
void build_tree(int L, int R, int node) {
    if(L == R) {
        segment_tree[node] = hotel[L];
    }
    else {
        int middle = (L + R) / 2;
        build_tree(L, middle, 2 * node);
        build_tree(middle + 1, R, 2 * node + 1);
        segment_tree[node] = merge_nodes(segment_tree[2 * node], segment_tree[2 * node + 1]);
    }
}
void update(int idx, int new_value, int L, int R, int node) {
    if(L == R) {
        segment_tree[node] -= new_value;
        return;
    }
    int middle = (L + R) / 2;
    if(idx <= middle) {
        update(idx, new_value, L, middle, 2 * node);
    }
    else {
        update(idx, new_value, middle + 1, R, 2 * node + 1);
    }

    segment_tree[node] = merge_nodes(segment_tree[2 * node], segment_tree[2 * node + 1]);
}
// i L R j
int query(int x, int L, int R, int node) {
    if(L == R) {
        return L;
    }
    int middle = (L + R) / 2;
    if(segment_tree[2 * node] >= x) {
        return query(x, L, middle, 2 * node);
    }
    else {
        return query(x, middle + 1, R, 2 * node + 1);
    }

}
int main() {
    ios_base::sync_with_stdio(false);
    cin >> n >> m;

    for(int i = 0; i < n; i++) {
        cin >> hotel[i];
    }

    for(int j = 0; j < m; j++) {
        cin >> room[j];
    }

    build_tree(0, n - 1, 1);

    for(int i = 0; i < m; i++) {
        if(segment_tree[1] < room[i]) {
            cout << 0 << " ";
            continue;
        }
        int id = query(room[i], 0, n - 1, 1);
        cout << id + 1 << " ";
        update(id, room[i], 0, n - 1, 1);
    }

    return 0;
}