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

ifstream fin("secventa.in");
ofstream fout("secventa.out");

const int  N=500001;

int d[N], v[N];

int main()
{
    int i, n, k, front=0, back=-1, maxim=-9999999, front_max, back_max;
    //d reprezinta deque-ul
    fin>>n>>k;
    for(i=0; i<n; i++)
    {
        fin>>v[i];

        if(front <= back && d[front]==i-k)
        {
            ++front;
        }

        while(front<=back && v[i]<=v[d[back]])
        {
            --back;
        }

        d[++back]=i;
        if(i>=k-1)
      { 
          if(v[d[front]]>maxim)
        {
            maxim=v[d[front]];
            front_max=i-k+2;
            back_max=i+1;
        }
         
      }
       
    }

    fout<<front_max<<' '<<back_max<<' '<<maxim;
    return 0;

}