from itertools import accumulate
n,q=map(int,input().split())
a=list(map(int,input().split()))
b=[]
for i in range(n):
    for j in a[:i+1]:
        b.append(j)
b=list(accumulate(b))
m=len(b)
import bisect
for _ in range(q):
    s=int(input())
    num=bisect.bisect_right(b,s)
    if num>=m:
        print(-1)
    else:
        print(num)