from bisect import bisect_left

n, q = map(int, input().split())
A = list(map(int, input().split()))
cum = [0]
for i in range(n):
    for j in range(i + 1):
        cum.append(cum[-1] + A[j])

for _ in range(q):
    S = int(input())
    if S > cum[-1]:
        print(-1)
    else:
        print(bisect_left(cum, S))