#include <fstream>
#include <deque>
#include <algorithm>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
long long v[500005],n,k,i,Max=-50000,s,c[500005];
deque <int> q;
int main()
{
    f>>n>>k;
    for(i=1;i<=n;i++)
        f>>v[i];
    q.push_back(1);
    for(i=2;i<=k;i++)
    {
        while(!q.size()==0&&v[q.back()]>v[i])
            q.pop_back();
        q.push_back(i);
    }
    if(v[q.front()]>Max)
    {
        Max=v[q.front()];
        for(i=1;i<=k;i++)
            c[i]=v[i];
    }
    for(i=k+1;i<=n;i++)
    {
        if(!q.size()==0&&q.front()+k<=i)
            q.pop_front();
        while(!q.size()==0&&v[q.back()]>v[i])
            q.pop_back();
        q.push_back(i);
         if(v[q.front()]>Max)
        {
            Max=v[q.front()];
            for(int j=k;j>=1;j--)
                c[j]=v[i-j+1];
        }
    }
    for(i=1;i<=k;i++)g<<c[i]<<' ';
    return 0;
}