from bisect import bisect
N,K = map(int,input().split())
A = list(map(int,input().split()))
now = sum(A[:K])
S = [now]
for i in range(0,N-K):
    now -= A[i]
    now += A[i + K]
    S.append(now)
S.sort()
for _ in range(int(input())):
    x = int(input())
    print(bisect(S,x))