#include <bits/stdc++.h>
using namespace std;
#define f(i,k,n) for(int i=k; i<n; i++)
#define ll long long
const int inf = INT_MAX;

void solve()
{
    int n,k;
    cin>>n>>k;
    int a[n];
    int x;
    cin>>x;
    a[0]=x;
    int mod=x;
    f(i,1,n)
    {
        cin>>x;
        mod+=x;
        a[i]=a[i-1]+x;
    }
    f(i,0,k)
    {
        cin>>x;
        x=x%mod;
        auto it=lower_bound(a,a+n,x);
        if(x==0)    cout<<n-1<<" ";
        else    cout<<it-a+1<<" ";
    }
    cout<<"\n";

}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin>>t;
    while(t--)  solve();
    return 0;
}