from bisect import bisect_right
from itertools import accumulate


def main():
    n, k = map(int, input().split())
    a = list(map(int, input().split()))

    acc = list(accumulate(a))
    s = [acc[k - 1]] + [acc[i + k - 1] - acc[i - 1] for i in range(1, n - k + 1)]
    s.sort()

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


if __name__ == "__main__":
    main()