n,Q=map(int,input().split())
t=list(map(int,input().split()))
for i in range(1,n):
  t[i]+=t[i-1]
from bisect import bisect_right
for i in range(Q):
  x=int(input())
  print(bisect_right(t,x))