#include <fstream>
#include <deque>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
const int nmax = 5000005 ;
deque <int> dq;
int a[nmax];
int fr, bk, i, n, k, maxi=-1e8, poz;
long long sum=0;

int main()
{
    f >> n >> k;
    for( i = 0 ; i <= n; i++ )
        f >> a[i];

    for( i = 1 ; i <= n ; i++ )
        {
        while ( !dq.empty() && a[i] <= a[dq.empty()] )
            dq.pop_back();

            dq.push_back(i);

        if( i == dq.front() + k )
            dq.pop_front();
            if(i>=k)
            {
                if(maxi < a[dq.front()])
                {
                    maxi = a[dq.front()];
                    poz = i;
                }
            }
        }

    g << poz-k+1 << " " << poz << " " <<maxi;


  /* for(i=1; i<=n; i++)
   g << a[dq.front()]<<" ";
*/
    return 0;
}