#include <iostream>
#include<fstream>
#include<deque>
using namespace std;
deque<int>dq[3];
int pi,pf,k,n,i,x,mini=-100000;
int main()
{
     freopen("secventa.in","r",stdin);
     freopen("secventa.out","w",stdout);
        scanf("%d%d",&n,&k);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&x);
        while(!dq[0].empty() && x<=dq[0].back())
            {dq[0].pop_back(); dq[1].pop_back();}
        dq[0].push_back(x);
        dq[1].push_back(i);
        if(dq[1].front()==i-k)
            {dq[0].pop_front(); dq[1].pop_front();}
        if(i>=k)
        if(mini<dq[0].front())
        {
            mini=dq[0].front();
            pi=i-k+1;
            pf=i;
        }
            }
           printf("%d %d %d",pi,pf,mini);
}