#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
const int MAXN = 5e5;

int v[MAXN+1];
deque <int> q;

FILE *fin, *fout;
int readInt() {
  int ch, res = 0, semn = 1;
  while ( isspace( ch = fgetc( fin ) ) );
  if ( ch == '-' ) {
    semn = -1;
    ch = fgetc( fin );
  }
  do
    res = 10 * res + ch - '0';
  while ( isdigit( ch = fgetc( fin ) ) );

  return semn * res;
}

int main() {
  int n, k, i, bmax, st;
  fin = fopen( "secventa.in", "r" );
  fout = fopen( "secventa.out", "w" );
  fscanf( fin, "%d%d", &n, &k );
  bmax = -50000;
  for( i = 1; i <= n; i++ ) {
    v[i] = readInt();
    if( i > k ) {
      if( i - k == q.front() )
        q.pop_front();
    }
    while( !q.empty() && v[i] <= v[q.back()] )
      q.pop_back();
    q.push_back( i );
    if( i >= k ) {
      if( v[q.front()] > bmax ) {
        bmax = v[q.front()];
        st = i;
      }
    }
  }
  fprintf( fout, "%d %d %d", st - k + 1, st, bmax );
  return 0;
}