#include <fstream>
#include <algorithm>
#include <deque>
using namespace std;
ifstream in ("secventa.in");
ofstream out ("secventa.out");
int main()
{
    int n,k,max1=-10000000,ll;
    in>>n>>k;
    deque<int>secv;
    int v[100001];
    for (int i=1;i<=k;++i)
    {
        int w;
        in>>w;
        secv.push_back(w);
        v[i]=w;
    }
    for (int i=k;i<=n;++i)
    {
        deque <int>::iterator a=min_element(secv.begin(),secv.end());
        if (max(*a,max1)>max1)
        {
            max1=max(*a,max1);
            ll=i;
        }
        int w;
        in>>w;
        secv.pop_front();
        secv.push_back(w);
        v[i]=w;
    }
    for (int i=ll-1;i>=ll-k;--i)
        out<<v[i]<<' ';
    return 0;
}