#include <deque>
#include <stdio.h>

using namespace std;

deque <int> coada;

int sir[500010],n,k;
int start,max_min;

void citire()
{
    //fin>>n>>k;
    scanf ("%d %d",&n,&k);
    for (int i=0;i<n;i++)
     //   fin>>sir[i];
        scanf ("%d",&sir[i]);
}

void solve()
{
    start=0;
    for (int i=0;i<k;i++)
    {
        while (!coada.empty() && sir[coada.back()]>=sir[i])
            coada.pop_back();
        coada.push_back(i);
    }

    max_min=sir[coada.front()];

    for (int i=k;i<n;i++)
    {
        if (coada.front()==i-k)
            coada.pop_front();
        while(!coada.empty() && sir[coada.back()]>=sir[i])
            coada.pop_back();
        coada.push_back(i);
        if (sir[coada.front()]>max_min)
        {
                max_min=sir[coada.front()];
                start=i-k+1;
        }
    }
}

void afisare()
{
    //fout<<start+1<<" "<<start+k<<" "<<max_min<<"\n";
    printf("%d %d %d\n",start+1,start+k,max_min);
}

int main ()
{

freopen ("secventa.in","r",stdin);
freopen ("secventa.out","w",stdout);
    citire();
    solve();
    afisare();
    return 0;
}