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

ifstream f("secventa.in");
ofstream g("secventa.out");
int n , k , a[500002],poz,max1=-1e8;
deque <int> dq;
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()&&a[i]<=a[dq.back()])
         dq.pop_back();

        dq.push_back(i);

         if( i == dq.front() + k)
         dq.pop_front();

         if(i>=k)
        {
            if(max1<a[dq.front()])
            {
                max1=a[dq.front()];
                poz=i;
            }
        }
    }
    g <<poz-k+1<<" "<<poz<<" "<<max1;

}