#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int max_n=1000005;
int n,k,a[max_n],mi[max_n][20],ma[max_n][20],c,v,h;
inline int RMQ()
{
	for(int i=1;i<=n;i++)
	mi[i][0]=a[i],ma[i][0]=a[i];
	for(int i=1;(1<<i)<=n;i++)
	for(int j=1;j+(1<<i)<=n+1;j++)
	{
		mi[j][i]=min(mi[j][i-1],mi[j+(1<<(i-1))][i-1]);
		ma[j][i]=max(ma[j][i-1],ma[j+(1<<(i-1))][i-1]);
	}
}
inline void len(int k)
{
	while(1<<(h+1)<k)
	{
		h++;
	}
	//c=min(mi[x][h],mi[y-(1<<h)][h]);
	//v=max(ma[x][h],ma[y-(1<<h)][h]);
}
int main()
{
	freopen("window.in","r",stdin);
	freopen("window.out","w",stdout);
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)
	scanf("%d",&a[i]);
	RMQ();
	len(k);
/*	for(int i=1;i<=n-1;i++)
	cout<<mi[i][1]<<" ";
*/	for(int i=1;i+k<=n+1;i++)
	{
		cout<<min(mi[i][h],mi[i+k-(1<<h)][h])<<" ";
	}
	for(int i=1;i+k-1<=n;i++)
	cout<<max(ma[i][h],ma[i+k-(1<<h)][h])<<" ";
	return 0;
}