#include <iostream>
#include <fstream>
#include <deque>
using namespace std;

int main()
{
    ifstream intrare("secventa.in");
    ofstream iesire("secventa.out");
    deque<int> coada;
    int n,k,valoare[500001],mem,i,maxim=-30001;
    intrare>>n;
    intrare>>k;
    for (i=1;i<=n;i++)
    {
        intrare>>valoare[i];
    }
    for (i=1;i<=n;i++)
    {
        while (!coada.empty()&&valoare[coada.back()]>valoare[i]){coada.pop_back();}
        coada.push_back(i);
        if (coada.back()-coada.front()>=k){coada.pop_front();}
        if (maxim<valoare[coada.front()]&&i>=k){maxim=valoare[coada.front()];mem=i;}
    }
    for (i=mem-k;i>=1;i--)
    {
        if (valoare[i]>maxim){mem-=1;}
    }
    iesire<<mem-k+1<<" "<<mem<<" "<<maxim;
}