#include <bits/stdc++.h>

using namespace std;

ifstream f("secventa.in");
ofstream g("secventa.out");

int cauta_minim(int v[500001], int k, int p)
{
    int minim = 30001;
    for (int i = p; i < p + k; i++)
        if (minim > v[i])   minim = v[i];

    return minim;
}

int n, k, v[500001], i;

int main()
{
    int poz, maxim = -30001, m;
    f >> n >> k;
    for (i = 1; i <= n; i++)    f >> v[i];

    for (i = 1; i <= n - k + 1; i++)
    {
        m = cauta_minim(v, k, i);
        if (maxim < m)
        {
            poz = i;
            maxim = m;
        }
    }

    for (i = poz; i < poz + k; i++)
        g << v[i] << " ";

    f.close();
    g.close();

    return 0;
}