// #include <algorithm>
#include <stdio.h>
#include <vector>
#include <math.h>
#include <deque> 
#include <iostream>
using namespace std;

vector<unsigned int> Parent;
unsigned int queries;

// Sliding Window Minimum
void swm(vector<int> & elements, const int winsize){
  deque< pair<int, int> > window;
  int fb = 0; // first buffer
  for(int i = 0; i < elements.size() ; i++){
    while(!window.empty() && window.back().first >= elements[i] ){
      window.pop_back();
    }
    window.push_back(make_pair(elements[i], i));

    while(window.front().second <= i - winsize){
      window.pop_front();
    }
    fb++;
    if(fb >= winsize){
      printf("%d" , window.front().first);
      if(i < elements.size()-1){
        printf(" ");
      }
    }
  }
  printf("\n");
}

void ass(vector<int> v){
  int i = 0;
  for(const auto& e: v){
    printf("[%d]=%d\n" ,i ,e ); 
    i++;
  }
}

int main(){
	int N, L;
  scanf("%d %d" ,&N, &L);
  vector<int> elements(N);
  for(int i = 0 ; i < N; i++){
    int v;
    scanf("%d" ,&v );
		elements[i] = v;
  }
  swm(elements, L);
  return 0;
}

