import bisect

n, k = [int(v) for v in input().split()]
a = [int(v) for v in input().split()]
s = sum(a[:k])
s_list = [s]
for i in range(n - k):
    s += (a[k + i] - a[i])
    s_list.append(s)
s_list.sort()

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