class Heep
  def initialize
    @node = []
  end
  def insert(num)
    i = @node.size
    @node[i] = num
    p = (i+1)/2-1
    while i > 0 && @node[p] < @node[i]
      @node[i], @node[p] = @node[p], @node[i]
      i = p
      p = (i+1)/2-1
    end
  end
  def extract
    ret = @node[0]
    @node[0] = @node.pop()
    maxHeapify(0)
    return ret
  end
  def maxHeapify(i)
    h = @node.size
    largest = i
    l = 2 * i + 1
    largest = l if l < h && @node[l] > @node[largest]
    r = 2 * i + 2
    largest = r if r < h && @node[r] > @node[largest]
    if largest != i then
      @node[i], @node[largest] = @node[largest], @node[i]
      maxHeapify(largest)
    end
  end
end


n, len = gets.split.map(&:to_i)
arr = gets.split.map(&:to_i)
max = arr.max
heep = Heep.new()

pos = {}
len.times{|i|
  pos[arr[i]] = i
  heep.insert(max - arr[i])
}
min = max - heep.extract
idx = pos[min]

print min

i = len
j = 0
loop do
  break if i >= n

  # slide window
  unless pos[arr[i]]
    heep.insert(max - arr[i])
  end
  pos[arr[i]] = i
  pos.delete(arr[j]) if pos[arr[j]] == j

  if min >= arr[i] then
    min = arr[i]
    idx = i
  elsif idx == j then
    oldmin = min
    loop do
      min = max - heep.extract
      break if min != oldmin
    end
    idx = pos[min]
  end
  print " #{min}"
  i += 1
  j += 1
end

puts