#include <iostream>
#include <fstream>
#include <vector>
#include <deque>

using namespace std;

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

int n,k,x,ma=-30005,l,r,v[500005];
deque < int > dq;

int main()
{
    fin >> n >> k;
    for(int i=1;i<=n;i++)
    {
        fin >> v[i];
        while(!dq.empty() && v[dq.back()]>v[i])
            dq.pop_back();
        dq.push_back(i);
        if(dq.front()==i-k)
            dq.pop_front();
        if(i>=k && v[dq.front()]>ma)
        {
            ma=v[dq.front()];
            l=i-k+1;
            r=i;
        }
    }
    fout << l << " " << r << " " << ma;
    return 0;
}