#include <stdio.h>

#include <list>
#include <deque>

#define FISIN     "secventa.in"
#define FISOUT    "secventa.out"

FILE *fin, *fout;

class strange_queue {
public:

  struct elem { 
    elem(int k, int v) : key(k), value(v) { }
    int key, value; 
  };
  
  void add(const elem& e) {
    while (!m_list.empty() && (e.value < m_list.back().value)) m_list.pop_back();
    m_list.push_back(e);
  }
  void del(int key) {
    if (m_list.front().key == key) m_list.pop_front();
  }
  int min() { return m_list.front().value; }

private:
  std::deque<elem> m_list;
};

strange_queue q;

int main() {
  fin = fopen(FISIN, "rt");
  fout = fopen(FISOUT, "wt");

  int n, k; fscanf(fin, "%d %d", &n, &k);
  for (int i = 0; i < k; ++i)  {
    int a;
    fscanf(fin, "%d", &a);
    q.add(strange_queue::elem(i, a));
  }
  int best_start = 0; int best_base = q.min();
  
  for (int i = k; i < n; ++i) {
    int a; fscanf(fin, "%d", &a);
    int start = i - k;
    q.del(start);
    q.add(strange_queue::elem(i, a));
    int m = q.min(); 
    if (m > best_base) {
      best_base = m;
      best_start = i - k + 1;
    }
  }

  best_start++;
  fprintf(fout, "%d %d %d\n", best_start, best_start + k - 1, best_base);

  fclose(fout);
  fclose(fin);
  return 0;
}