N,K=map(int,input().split())
l=list(map(int,input().split()))
L=[sum(l[:K])]

for i in range(N-K):
    A=L[-1]+l[K+i]-l[i]
    L.append(A)
L.sort()
L=[-10**20]+L+[10**20]
#print(L)

import bisect

Q=int(input())
for i in range(Q):
    n=int(input())
    print(bisect.bisect_right(L,n)-1)