from itertools import accumulate
from bisect import bisect_right


def accum(a: list):
    acc = list(accumulate(a))
    return lambda l, r: acc[r] - (acc[l-1] if l > 0 else 0)


N, K = map(int, input().split())
A = list(map(int, input().split()))

acc = accum(A)
ss = []
for i in range(K-1, N):
    s = acc(i-K+1, i)
    ss.append(s)
ss.sort()

Q = int(input())
for _ in range(Q):
    x = int(input())
    ans = bisect_right(ss, x)
    print(ans)