#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
long long n,m,k,i,a,sum,j;
int main()
{
    ios::sync_with_stdio(false);
    cin>>n>>m;
    vector <int> x(n+2,0);
    vector <int>::iterator it;
    x[0]=0;
    for (i=1;i<=n;++i)
    {
        cin>>a;
        x[i]=x[i-1]+a;
        sum+=a;
    }
    vector <pair<int,int> > y(m+1,{0,0});
    vector <int> megold(m+1);
    for (i=1;i<=m;++i)
    {
        cin>>k;
        k=k%sum;
       /* it=lower_bound(x.begin()+1,x.end(),k);
        cout<<it-x.begin()<<" ";*/
        y[i]={k,i};
    }
    sort(y.begin()+1,y.end());
    i=1;
    j=1;
    while (i<=n&&j<=m)
    {
        if (y[j].first<=x[i])
        {
            megold[y[j].second]=i;
            j++;
        }
        else i++;
    }
    for (i=1;i<=m;++i) cout<<megold[i]<<" ";
    return 0;
}