#include <fstream>
#include <algorithm>
using namespace std;

ifstream is("secventa.in");
ofstream os("secventa.out");

long n, k;
int a[500001];
int minim = 40000;
int aux;

struct Secventa{
    int st, dr, min;
};
Secventa c[500001];

bool Cmp(const Secventa & c1, const Secventa & c2)
{
    return c1.min <= c2.min;
}

int main()
{
    is >> n;
    is >> k;
    for(int i = 1; i <= n; i++)
        is >> a[i];
    for(int i = 1; i <= n - k + 1; i++)
    {
        minim = 30002;
        for(int j = i; j < i+k; j++)
            if(minim > a[j])
            {
                minim = a[j];
                c[i].st = i;
                c[i].dr = i+k-1;
                c[i].min = minim;
            }
    }
    sort(c, c + k , Cmp);
    os << c[n - k + 1].st << ' ' << c[n - k + 1].dr << ' ' << c[n - k + 1].min << '\n';
    is.close();
    os.close();
    return 0;
}