#include <iostream>
#include <fstream>
#include <deque>

using namespace std;

ifstream in("secventa.in");
ofstream out("secventa.out");

const int NMAX=500005;

int v[NMAX];
deque<int> DQ;

int main()
{
    int n,k,x,i
    ;
    int nr=-999999;
    int poz;
    in>>n>>k;
    for(i=1; i<=n; i++)
    {
        in>>v[i];
    }

    for(i=1; i<k; i++)
    {
        while(DQ.empty()!=1 && v[DQ.back()]>v[i])
        {
            DQ.pop_back();
        }
        DQ.push_back(i);
    }
    for(i=k; i<=n; i++)
    {
        while(DQ.empty()!=1 && v[DQ.back()]>v[i])
        {
            DQ.pop_back();
        }
        DQ.push_back(i);

        if(DQ.front()<=i-k)
        {
            DQ.pop_front();
        }

        if(v[DQ.front()]>nr)
        {
            nr=v[DQ.front()];
            poz=i;
        }
    }

    out<<poz-k+1<<" "<<poz<<" "<<nr;

}