n, k = read_line.split.map(&.to_i)
a = read_line.split.map(&.to_i)
s = [a[0, k].sum]
(n - k).times{|i|
    s << s[-1] - a[i] + a[i + k]
}
s.sort!

q = read_line.to_i
q.times{
    x = read_line.to_i
    index = s.bsearch_index{|a, i|a > x} || s.size
    puts index
}