#include<cstdio>
#include<cmath>
#include<queue>
#include<iostream>
using namespace std;
int n,k;
long long a[2000005];
int main(){
	scanf("%d %d",&n,&k);
	for(int i=1;i<=n;i++){
		scanf("%lld",&a[i]);
	}
	deque<int> que1;
	for(int i=1;i<=n;i++){
		if(i-que1.front()==k&&!que1.empty()) que1.pop_front();
		while(!que1.empty()&&a[i]>a[que1.back()]) que1.pop_back();
		que1.push_back(i);
		if(i>=k) printf("%lld\n",a[que1.front()]);
	}
	return 0;
}