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