#include <iostream>
#include<fstream>
#include<deque>
using namespace std;
deque<pair <long long,long long> >dq;
long long pi,pf,k,n,i,x,mini=-100000;
int main()
{
    ifstream f("secventa.in");
    ofstream g("secventa.out");
    f>>n>>k;
    for(i=1;i<=n;i++)
    {
        f>>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;
        }
            }
            g<<pi<<" "<<pf<<" "<<mini;
}