#include <fstream>
#include <deque>
using namespace std;
deque <int> deck;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int main()
{
    int n,k,i,x=0,y,sol=-100000000;
    fin>>n>>k;int v[n];
    y=k;
    for(i=1;i<=n;i++)
    {
        fin>>v[i];
        while(!deck.empty()&& deck.front()<=i-k) deck.pop_front();
        while(!deck.empty()&& v[deck.back()]>=v[i]) deck.pop_back();
        deck.push_back(i);
        if(v[deck.front()]>sol&&i>=k) sol=v[deck.front()],x=deck.front(),y=i;

    }
    fout<<x<<" "<<y<<" "<<sol;
}