#include <bits/stdc++.h>
using namespace std;
int n, v[500000];
set <int> s;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int main()
{
  int n,k,g,min,min_max,ind1,ind2;
  fin >> n >> k;
  for(int i=1;i<=n;i++){
      fin >> v[i];
  }
  for(int i=1;i<=k;i++){
      s.insert(v[i]);
  }
  for (auto x : s){
      min = x;
      break;
  }
  min_max = min;
  ind1 = 1;
  ind2 = k;
  for(int i=k+1;i<=n;i++){
      s.erase(v[i-k]);
      s.insert(v[i]);
      for (auto x : s){
      min = x;
      break;
  }
  if(min > min_max){
      min_max = min;
      ind1 = i-k+1;
      ind2 = i;
  }
  }
  fout << ind1 << " " << ind2 << " " << min_max;
}