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