#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");

int n,k, a[500005], maxim, solmaxim, st, dr;

int main()
{
    int i,j;
    fin >> n >> k;
    for (i = 1; i <= n; i++)
        fin >> a[i];
    for (i = 1; i <= n - k+1; i++)
    {
        maxim = 1e9;
        for (j = i; j < i + k; j++)
            maxim = min(maxim, a[j]);
        if (maxim >= solmaxim)
        {
            solmaxim = maxim;
            st = i; dr = i + k-1;
        }
    }
    fout << st << " " << dr << " " << solmaxim;
    return 0;
}