n, k = map(int, input().split())
A = list(map(int, input().split()))

L = []
S = sum(A[0:k])
L.append(S)
for i in range(n-k):
    S -= A[i]
    S += A[i+k]
    L.append(S)
#print(L)
L.sort()
q = int(input())
import bisect
for i in range(q):
    x = int(input())
    ans = bisect.bisect_right(L, x)
    print(ans)