#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream f ("a.in");
ofstream g ("a.out");
deque<int> dq;
int v[500001];
long long n,k,inceput,lmin,baza=-40000;
int main()
{
    f >> n >> k;
    for(int i = 1; i<=n; i++)
    {
        f >> v[i];
        while(!dq.empty() && v[dq.back()]>v[i])
        {
            dq.pop_back();
        }
        if(!dq.empty() && dq.front()==i-k)
            dq.pop_front();
        dq.push_back(i);
        if(i>=k)
        {
                if(v[dq.front()]>baza)
                {
                    baza = v[dq.front()];
                    lmin = i-dq.front();
                    inceput  = dq.front();

                }
                if(v[dq.front()] ==baza)
                    lmin++;
        }
    }
    g << inceput<< " " << inceput+lmin-1<< " "<<baza;

}