#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
  int v[5000010], i, n, k, pi, ps, baza;
  deque <int> q;

int main () {
  fin>>n>>k;

  for (i = 1; i <= n; i++)
    fin>>v[i];

  baza = v[1];
  for (i = 1; i <= n; i++) {
    //pi = i;
    while (!q.empty() && v[i] <= v[q.back()]) {
      pi = q.back();
      q.pop_back();
    }
    q.push_back(i);
    if (q.front() <= i - k)
      q.pop_front();
    if (i >= k && v[q.front()] > baza) {
      baza = v[q.front()];
      pi = i - k + 1;
      ps = i;
    }
  }
  fout<<pi<<" "<<ps<<" "<<baza;
}