#include <fstream>
#include <algorithm>
#include <deque>

using namespace std;

ifstream fin("secventa.in");
ofstream fout("secventa.out");

int n, k;
deque < pair < int, int > > DQ;
int max_base, l, r;

int main()
{
    int x, i;
    fin >> n >> k;
    max_base = -30001;
    for (i = 1; i <= n; ++ i)
        {
         fin >> x;
         while (!DQ.empty() && x < DQ.back().first)
            DQ.pop_back();
         DQ.push_back(make_pair(x, i));
         if (!DQ.empty() && DQ.front().second == i - k)
            DQ.pop_front();
         if (!DQ.empty() && i >= k && DQ.front().first > max_base)
            {
             max_base = DQ.front().first;
             l = DQ.front().second;
             r = DQ.back().second;
            }
        }
    fin.close();
    fout << l << " " << r << " " << max_base << "\n";
    fout.close();
    return 0;
}