#include <bits/stdc++.h>
using namespace std;

int n, q;
vector<int> start;

void solve() {
    cin >> n >> q;
    start.assign(1 + n, 0);
    for(int i = 1; i <= n; i++) {
        int x = 0;
        cin >> x;
        start[i] = start[i - 1] + x;
    }
    int sum = start[n];
    while(q--) {
        int x;
        cin >> x;
        x--;
        x %= sum;
        cout << int(upper_bound(start.begin(), start.end(), x) - start.begin()) << " ";
    }
    cout << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}