#include <deque>
#include <fstream>
#include <iostream>
using namespace std;
deque <signed> dq,pos;
int main ()
{
    ifstream fin ("secventa.in");
    ofstream fout ("secventa.out");
    signed int n,k,maxim=-30001;
    fin>>n>>k;
    signed int nr,v[n];
    for (int i=0;i<k;++i)
    {
        fin>>nr;
        v[i]=nr;
        while (!dq.empty() && dq.back()>=nr)
        {
            dq.pop_back();
            pos.pop_back();
        }
        dq.push_back(nr);
        pos.push_back(i);
    }
       // cout<<"dq.front()="<<dq.front()<<"\n";

    signed int s=dq.front();

    for (int i=k;i<n;++i)
    {
        if (pos.front()==i-k)
        {
            pos.pop_front();
            dq.pop_front();
        }
        fin>>nr;
        v[i]=nr;
        while (!dq.empty() && dq.back()>nr)
        {
            pos.pop_back();
            dq.pop_back();
        }
        dq.push_back(nr);
        pos.push_back(i);
    s=dq.front();

        if (maxim<s)
        {
            maxim=s;
           // cout<<"maxim 1 "<<maxim<<endl;
//            p=pos.front();
        }
        if (maxim<s)
        {
            //p=pos.front();
            maxim=s;
            //cout<<"maxim 2 "<<maxim<<" "<<endl;
        }
    }
    //cout<<p<<" "<<v[p]<<"\n";
    for (int i=0;i<n;++i)
    {
        if (v[i]==maxim)
        {
        int x,y;
        for (x=i;x>0;--x)
        {
            if (v[x-1]<maxim && x)
            {
                break;
            }
        }
        //cout<<x<<" "<<v[5]<<endl;
        x++;
        for (y=i;y<n-1;++y)
        {
            if (v[y+1]<maxim)
            {
                break;
            }
        }
        y++;
        if (y-x+1>=k)
        {
        fout<<x<<" "<<y<<" "<<maxim;
        break;
        }
        }
    }
}