#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
deque < int > dq;
int v[500005];
int main() {
  int n, k;
  int mx = 0;
  pair < int, int > ans;
  in >> n >> k;
  for (int i = 1; i <= n; i++) {
    in >> v[i];
  }
  for (int i = 1; i <= n; i++) {
    while(!dq.empty() && v[i] <= v[dq.back()])
    dq.pop_back();
    dq.push_back(i);
    while(!dq.empty() && i - k >= dq.front()) {
      dq.pop_front();
    }
    if (i >= k && v[dq.front()] > mx) {
      mx = v[dq.front()];
      ans.x = i - k + 1;
      ans.y = i;
    }
  }
  out << ans.x << " " << ans.y << " " << mx;
  return 0;
}