import sys
import bisect

def main():
    data = list(map(int, sys.stdin.read().split()))
    ptr = 0
    n, k = data[ptr], data[ptr+1]
    ptr += 2
    a = data[ptr:ptr+n]
    ptr += n
    q = data[ptr]
    ptr += 1
    x_list = data[ptr:ptr+q]
    
    if k == 0:
        for _ in range(q):
            print(0)
        return
    
    sum_val = sum(a[:k])
    sums = [sum_val]
    for i in range(n - k):
        sum_val += a[i + k] - a[i]
        sums.append(sum_val)
    
    sums.sort()
    
    for x in x_list:
        print(bisect.bisect_right(sums, x))

if __name__ == "__main__":
    main()