import bisect
N,K = map(int, input().split())
A = [int(a) for a in input().split()]

num = sum(A[:K])
S = [num]
for i in range(N-K):
    num -= A[i]
    num += A[i+K]
    S.append(num)

S.sort()
Q = int(input())
for _ in range(Q):
    x = int(input())
    ans = bisect.bisect_right(S, x)
    print(ans)