#include<iostream>
#include<fstream>
#include<deque>
#include<vector>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
struct coord
{
    int x,y,val;
};
int n,k;
int v[500005];
vector<coord> minime;
deque<int> q;
void Citire()
{
    f>>n>>k;
    for(int i=1;i<=n;i++)
        f>>v[i];
}
void Solve()
{
    int min1=v[1];
    int st=1;
    int dr=0;
    for(int i=1;i<=n;i++)
    {
        dr++;
        while(!q.empty() && v[q.back()]>v[i])
            q.pop_back();
        q.push_back(i);
        if(i-q.front()>=k)
            q.pop_front();
        if(!q.empty())
            if(v[q.front()]!=min1)
            {
                coord numar;
                numar.x=st;
                numar.y=dr-1;
                numar.val=min1;
                minime.push_back(numar);
                st=i;
                min1=v[q.front()];
                if(i==n)
                {
                    numar.x=n-k+1;
                    numar.y=n;
                    numar.val=min1;
                    minime.push_back(numar);
                }
        }
    }
    min1=-30001;
    st=0;
    dr=0;
    for(int i=0;i<minime.size();i++)
        if(minime[i].val>min1)
        {
            min1=minime[i].val;
            st=minime[i].x;
            dr=minime[i].y;
        }
    g<<st<<" "<<dr<<" "<<min1;
}
int main()
{
    Citire();
    Solve();
}