#include <iostream>

using namespace std;

int n, q, x;

int binarysearch(pair<long long, long long> a[]){
    int low=0, mid, high=n-1;
    while(low<=high){
        mid=low+(high-low)/2;
        if(a[mid].first<=x&&a[mid].second>=x){
            return mid;
        }
        if(a[mid].second<x){
            low=mid+1;
        }
        else{
            high=mid-1;
        }
    }
    return mid;
}

int main()
{
    long long hossz=0;
    cin >> n >> q;
    pair<long long, long long> a[n];
    cin >> a[0].second;
    a[0].first=1;
    for(int i=1; i<n; i++){
        a[i].first=a[i-1].second+1;
        cin>>x;
        a[i].second=a[i-1].second+x;
    }
    hossz=a[n-1].second;
    for(int i=0; i<q; i++){
        cin >> x;
        x=x%hossz;
        cout << binarysearch(a)+1 << ' ';
    }
    return 0;
}