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

int main(){
  using ll=long long;
  int n,q;
  cin>>n>>q;
  vector<ll> c(n+1);
  for (int i=0;i<n;i++){
    int t;
    cin>>t;
    c[i+1]=c[i]+t;
  }
  while (q--){
    ll x;
    cin>>x;
    int ans=upper_bound(c.begin(),c.end(),x)-c.begin()-1;
    cout<<ans<<endl;
  }
}