from bisect import bisect_right
N, K = map(int, input().split())
A = list(map(int, input().split()))
sumA = [0] * (N + 1)

for i in range(N):
    sumA[i + 1] = sumA[i] + A[i]

S = [0] * (N - K + 1)

for i in range(N - K + 1):
    S[i] = sumA[i + K] - sumA[i]
S.sort()
#print(sumA)
#print(S)

Q = int(input())
for _ in range(Q):
    x = int(input())
    ans = bisect_right(S, x)
    if ans < len(S) and S[ans] == x:
        ans += 1
    print(ans)