from bisect import bisect_right

n, k = map(int, input().split())
alst = list(map(int, input().split()))
total = sum(alst[:k])
lst = [total]
for i in range(n - k):
    total -= alst[i]
    total += alst[i + k]
    lst.append(total)
lst.sort()

q = int(input())
for _ in range(q):
    print(bisect_right(lst, int(input())))