rt

#include<bits/stdc++.h>
using namespace std;
int a[2000010],q[2000010];
//priority_queue<int>q;
int main()
{
	int n,k;
	cin>>n>>k;
	for(int i=1;i<=n;i++)
	cin>>a[i];
	int tail=4,head=1;	
	int ans=-0x3f;
	for(int i=1;i<=k;i++)
	{
		q[i]=a[i];
		ans=max(ans,q[i]);
	}
	
	cout<<ans<<endl;
	for(int i=k+1;i<=n;i++)
	{
		//head++;
		while(head<=tail&&i-k>=head) head++;
		while(head<=tail&&a[i]>=q[tail]) tail--;
		q[++tail]=a[i];
		cout<<q[head]<<endl;
	}
	return 0;
	
	
 }