#include<fstream>
#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
#define pb push_back
#define x first
#define y second
#include<deque>
#define DN 500005
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n,k,a[DN],st,dr,ma=-(1<<28);
deque<pair<int,int> >d;
int main()
{
    fin>>n>>k;
    for(int i=1;i<=n;i++)
        fin>>a[i];
    for(int i=1;i<=n;i++)
    {
        while(1)
        {
            if(d.empty())
                break;
            if(d.back().y<a[i])
                break;
            d.pop_back();
        }
        d.pb({i,a[i]});
        while(1)
        {
            if(d.empty())
                break;
            if(d.front().x>=i-k+1)
                break;
            d.pop_front();
        }
        if(i>=k)
        {
            if(d.front().y>ma)
            {
                ma=d.front().y;
                st=i-k+1;
                dr=i;
            }
        }
    }
    fout<<st<<' '<<dr<<' '<<ma;
}