#include <cstdio>
#include <deque>
using namespace std;
deque <int> d;
const int NMAX = 500005;
int v[NMAX];

int main() {
  int n, k;
  freopen("secventa.in", "r", stdin);
  freopen("secventa.out", "w", stdout);
  scanf("%d%d", &n, &k);
  for(int i = 1; i <= n; ++i) {
    scanf("%d", &v[i]);
  }
  int pozi = 0, pozs = 0;
  int sol = -0x7fffffff;
  for(int i = 1; i <= n; ++i) {
    while(!d.empty() && v[d.back()] > v[i]) {
      d.pop_back();
    }
    while(!d.empty() && d.front() <= i - k) {
      d.pop_front();
    }
    d.push_back(i);
    if(sol < v[d.front()] && i >= k) {
      sol = v[d.front()];
      pozs = i;
      pozi = i - k + 1;
    }
  }
  printf("%d %d %d\n", pozi, pozs, sol);
  return 0;
}