#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");

deque<int> baza,poz;int sol,s1,s2;
short int a[500005];
int n,k;
void citire()
{
    f>>n>>k;
    for(int i=1;i<=n;i++) f>>a[i];
}
void init_baza()
{
    int bazaa=a[1],pozz=1;
    for(int i=2;i<=k;i++)
    {
        if(a[i]<=bazaa) bazaa=a[i],pozz=i;

    }
baza.push_front(bazaa);poz.push_front(pozz);

}
void solve()
{
    for(int i=k+1;i<=n;i++)
    {
        while(i-poz.front()>=k && poz.empty()==0) {poz.pop_front();baza.pop_front();}
        while(a[i]<baza.back() && baza.empty()==0) {poz.pop_back();baza.pop_back();}
        baza.push_back(a[i]);poz.push_back(i);

        if(baza.front()>sol) {sol=baza.front();s2=i;s1=i-k+1;}

    }
    g<<s1<<" "<<s2<<" "<<sol;

}
int main()
{
    citire();
    init_baza();
    solve();
    return 0;
}