#include<cstring>
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=1000005;
int n,k,a[maxn],minn[maxn][20],maxx[maxn][20],c,v,h;
inline int rmq()
{
	for(int i=1;i<=n;i++)
	minn[i][0]=a[i],maxx[i][0]=a[i];
	for(int i=1;(1<<i)<=n;i++)
	for(int j=1;j+(1<<i)<=n+1;j++)
	{
		minn[j][i]=min(minn[j][i-1],minn[j+(1<<(i-1))][i-1]);
		maxx[j][i]=max(maxx[j][i-1],maxx[j+(1<<(i-1))][i-1]);
	}
}
inline void len(int k)
{
	while(1<<(h+1)<k)
	{
		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+k<=n+1;i++)
	{
		cout<<min(minn[i][h],minn[i+k-(1<<h)][h])<<" ";
	}
	for(int i=1;i+k-1<=n;i++)
	cout<<max(maxx[i][h],maxx[i+k-(1<<h)][h])<<" ";
	return 0;
}