#include <fstream>
#include <deque>

using namespace std;

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

#define DIM 500000
#define INF (1LL << 25)

int n, k;
int v[DIM + 1];
deque <int> DQ;

//In Dq retin elementele in ordine crescatoare;

int main() {
  fin >> n >> k;
  for(int i = 1; i <= n; i++)
    fin >> v[i];

  //prelucram primele k elemente;
  for(int i = 1; i <= k; i++) {
    while(!DQ.empty() && v[DQ.back()] > v[i])
      DQ.pop_front();
    DQ.push_back(i);
  }

  int pmax = DQ.front();
  for(int i = k + 1; i <= n; i++) {
    while(!DQ.empty() && v[DQ.back()] > v[i])
      DQ.pop_back();
    DQ.push_back(i);

    //daca am o secventa mai mare de k elemente elimin elementul din varf;
    if(DQ.back() - DQ.front() + 1 > k)
      DQ.pop_front();
    
    if(v[pmax] < v[DQ.front()])
      pmax = DQ.front();
  }

  fout << pmax << " " << pmax + k - 1 << " " << v[pmax];

  return 0;
}