import bisect

N,Q = map(int,input().split())
A = list(map(int,input().split()))
S = [0]
for i in range(N):
  S.append(S[-1]+A[i])
  
for _ in range(Q):
  print(bisect.bisect_right(S,int(input()))-1)