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

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

int n , k ;
int st , dr , amax;
int a[500001];
deque < int > dq;
int amin =  -11000000;

int main()
{
    f >> n >> k;
    for ( int i = 1; i <= n ; i++ )
        f >> a[i];
    for ( int i = 1; i <= n ; i++ )
    {
        while(!dq.empty() and a[i] <= a[dq.back()])
            dq.pop_back();
        dq.push_back(i);
        if ( dq.front() <= i-k )
            dq.pop_front();
        if ( i >= k )
        {
            if ( a[dq.front()] > amin )
            {
                dr = i;
                st = dr-k+1;
                amin = a[dq.front()];
            }
        }
    }
    g <<st << " " << dr << " " << amin;
    return 0;
}