#include <iostream>
#include <string>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
int n,k,a[1000005],dp[1000005];

void dp_min()
{
	deque<int> q,t;
	for(int i=1;i<=n;i++)
	{
		while(q.front()<i-k+1&&!q.empty()) q.pop_front(),t.pop_front();
		while(a[i]<=t.back()&&!t.empty()) q.pop_back(),t.pop_back();
		q.push_back(i); t.push_back(a[i]);
		dp[i]=t.front();
		cout<<dp[i]<<" ";
	}
	return;
}

int main()
{
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	dp_min(); //dp_max();
	for(int i=k;i<=n;i++) cout<<dp[i]<<" ";
	return 0;
}