#include <bits/stdc++.h>
using namespace std;
int n, v[500000];
deque <int> q;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int main()
{
  int n,k,g,min,min_max,ind1,ind2,i;
  fin >> n >> k;
  for(i=1;i<=n;i++){
      fin >> v[i];
      while(!q.empty() && v[q.back()] > v[i]){
          q.pop_back();
      }
      q.push_back(i);
      if(i>k && q.front() == i - k)
      if(i>k){
          q.pop_front();
      }
  }
  fout << i-k << " " << i-1 << " "<< v[q.front()];
}