#include <bits/stdc++.h>
using namespace std;

vector<long long> v(100003);
long long a;

int kereses(int elso, int utso){
    while(elso < utso){
        int seg = (elso + utso) / 2;
        if(v[seg] > a) utso = seg;
        else elso = seg + 1;
    }
    return elso - 1;
}


int main()
{

//ifstream fin("be.txt");
//ofstream fout("ki.txt");
int n, k, seg;
cin>>n>>k;
long long ossz=1;
for(int i=1; i<=n; i++){
v[i]=ossz;
cin>>seg;
ossz+=seg;
}
v[n+1]=ossz;
ossz--;
for(int i=0; i<k; i++){
    cin>>a;
    a=a%ossz;
    if(a==0){
        cout<<n<<" ";
        continue;
    }
cout<<kereses(1, n+1)<<" ";
}


    return 0;
}