#include <bits/stdc++.h>
using namespace std;
int n,k,i,ma,df,v[5000010],mi,x,y,po;
long long s;
deque<int>dm;
queue<pair <int,int> >q;
pair <int,int>a;
int main()
{
    freopen("secventa.in","r",stdin);
    ofstream g ("secventa.out");
    scanf("%d%d",&n,&k);
    for(i=1; i<=n; ++i)
        scanf("%d",&v[i]);
    mi=10000001;
    for(i=1; i<=n; ++i)
    {
        while(!dm.empty()&&v[i]<v[dm.back()])dm.pop_back();
        dm.push_back(i);
        if(i-dm.front()==k)dm.pop_front();
        if(i>=k)q.push(make_pair(v[dm.front()],i));
    }
    while(!q.empty()){
        a=q.front();
        x=a.first;
        y=a.second;
        if(x>ma)ma=x,po=y;
        q.pop();}
        for(i=po;i>=po-k+1;--i)
        g<<v[i]<<" ";
    return 0;
}