// http://infoarena.ro/problema/secventa

#include <stdio.h>
long long array[10],stack[10];
int n,k,i,e,min = 30001,min_next = 30001,position;

FILE * in = fopen("secventa.in","rt");
FILE * out = fopen("secventa.out","wt");

int main()
{
     fscanf(in,"%lld",&n);
     fscanf(in,"%lld",&k);
     
     for(i=1;i<=n;i++)
	  fscanf(in,"%d",&array[i]);
     
     for(i=1;i<=k;i++)
     {
	  stack[i] = array[i];
	  
	  if(stack[i] < min)
	       min = stack[i];
     }
     
     for(i=k+1;i<=n-k+1;i++)
     {
	  min_next = 30001;
	  position = 0;
	  
	  for(e=i;e<i+k;e++)
	  {
	       if(array[e] > min && min_next > array[e])
		    min_next = array[e];
	  }
	  
	  if(min_next > min)
	  {
	       for(e=i;e<=i+k;e++)
		    stack[++position] = array[e];	  
	       min = min_next;
	  }
     }
     
     for(i=1;i<=k;i++)
	  fprintf(out,"%d ",stack[i]);
     
     return (0);
     
}