import bisect

n, k = map(int, input().split())
a = list(map(int, input().split()))
s = [0 for  _ in range(n-k+1)]
s[0] = sum(a[:k])
for i in range(1, n-k+1):
    s[i] = s[i-1] - a[i-1] + a[i+k-1]
s.sort()

q = int(input())

for i in range(q):
    x = int(input())
    result = bisect.bisect(s, x)
    print(result)