#include <iostream>
#include <map>
#include <vector>
using namespace std;

map<int,int> vlmi;
vector<int> a(100002,1e9);

int binkeres(int x, int kezd, int veg)
{
     int kozep;
    while(kezd<=veg)
    {
       kozep=(kezd+veg)/2;
       if(a[kozep]>=x && a[kozep-1]<x)
       {
            return kozep;
       }
       else if(a[kozep]<x && a[kozep+1]>=x)
       {
            return kozep+1;
       }
       else if(x>a[kozep])
       {
            kezd=kozep+1;
       }
       else
       {
            veg=kozep-1;
       }
    }
}


int main()
{
    int n,x,kdb;
    cin>>n>>kdb;
    a[0]=0;
    cin>>a[1];
    for(int i=2;i<=n;i++)
    {
        cin>>x;
        a[i]=a[i-1]+x;
    }
    int k;
    int hossz=a[n];
    for(int i=1;i<=kdb;i++)
    {
        cin>>k;
        k=k%(hossz);
        if(k==0)
        {
            cout<<n<<" ";
            continue;
        }
        if(k<a[1])
        {
            cout<<1<<" ";
        }
        else if(k>a[n-1])
        {
            cout<<n<<" ";
        }
        else
        {

            cout<<binkeres(k,1,n)<<" ";
        }
    }
}