n,k=map(int,input().split())
a=[0]+list(map(int,input().split()))
for i in range(1,n+1):
	a[i]+=a[i-1]
s=[a[i+k]-a[i] for i in range(n-k+1)]
s.sort()
from bisect import bisect_right
q=int(input())
for _ in range(q):
	x=int(input())
	print(bisect_right(s,x))