#include <cstdio>
#include <deque>
using namespace std;
deque<pair <int, int> >d;
pair<int, int>aux;
int main(){
  freopen("secventa.in", "r", stdin);
  freopen("secventa.out", "w", stdout);
  int n, k, poz, max = 0;
  scanf("%d%d", &n, &k);
  for (aux.second = 1; aux.second <= k; ++ aux.second){
    scanf("%d", &aux.first);
    while (!d.empty() && d.back().first >= aux.first)
      d.pop_back();
    d.push_back(aux);
  }
  max = d.front().first;
  poz = 1;
  for (aux.second = k + 1; aux.second <= n; ++ aux.second){
    scanf("%d", &aux.first);
    while (!d.empty() && d.back().first >= aux.first)
      d.pop_back();
    d.push_back(aux);
    if (d.front().second == aux.second - k)
      d.pop_front();
    if (max < d.front().first){
      max = d.front().first;
      poz = aux.second - k + 1;
    }
  }
  printf("%d %d %d\n", poz, poz + k - 1, max);
  return 0;
}