from itertools import accumulate
from bisect import bisect_left, bisect_right, insort
n,q=map(int,input().split())
A=list(map(int,input().split()))

B=[]
for i in range(n):
    B+=A[:i+1]

l=list(accumulate(B))

ans=[]
for i in range(q):
    s=int(input())
    if s>l[-1]:
        ans.append(-1)
    else:
        insort(l,s)
        ans.append(bisect_left(l,s)+1)
        l.remove(s)

for x in ans:
    print(x)