#include <iostream>
#include <fstream>
#include <cmath>
#include <deque>
using namespace std;
const int MOD=1234567;
ifstream f("secventa.in");
ofstream g("secventa.out");

int n,k,a[100005],minim=-30005,indice,ind;
deque <int> coada;
int main()
{
f>>n>>k;
for(int i=1;i<=n;i++)
 f>>a[i];
for(int i=1;i<=n;i++)
 {
  while( !coada.empty() && coada.front()<i-k+1 )
     coada.pop_front();
  while( !coada.empty() && a[i]<=a[coada.back()])
     coada.pop_back();
  coada.push_back(i);
  if(a[coada.front()]>minim&&i>=k)
   {
    minim=a[coada.front()];
    indice=coada.front();
    ind=i;
   }
 }
g<<ind-k+1<<" "<<ind<<" "<<minim;
}