#include <iostream>
#include <vector>

using namespace std;
int n;

void binarysearch(long long t,vector<pair<int,int>> &data)
{
int l=0,r=n-1;
while(l<=r)
    {
    int mid=(l+r)/2;
    if(data[mid].first<=t && data[mid].second>=t)
        {
        cout<<mid+1<<endl;
        return ;
        }
    if(data[mid].first>t)
        {
        r=mid-1;
        }
    else
        {
        l=mid+1;
        }
    }

}




int main()
{
    int q;
    cin>>n>>q;
    vector<pair<int,int>> data(n);
    long long tmp1,tmp2;
    data[0].first=1;
    cin>>data[0].second;
    long long sum=data[0].second;
    for(int i=1;i<n;i++)
        {
        data[i].first=data[i-1].second+1;
        cin>>data[i].second;
        sum+=data[i].second;
        data[i].second+=data[i-1].second;
        }
    int a;
    for(int i=0;i<q;i++)
        {
        cin>>tmp1;
        //cout<<(tmp1%sum)<<endl;
        a=(tmp1%sum);
        if(!a)
            {
            a=sum;
            }
        binarysearch(a,data);
        }
    return 0;
}