#include <bits/stdc++.h>

using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
struct plka
{
    int nr, in;
};
int n, k, Max, st, dr, x;
deque <plka> D;
int main()
{
    in >> n >> k;
    for(int i = 1;i <= n;i++)
    {
        in >> x;
        while(!D.empty() && x <= D.back().nr) D.pop_back();
        D.push_back({x, i});
        if(!D.empty() && D.front().in < i - k + 1) D.pop_front();
        if(i >= k && D.front().nr > Max)
        {
            Max = D.front().nr;
            st = i - k + 1;
            dr = i;
        }
    }
    out << st << " " << dr << " " << Max;
    return 0;
}