#include <cstdio>
#include <deque>

const int MAXN = 5e5;
const int INF = 2e9;

int v[MAXN];
std::deque <int> dq;

static inline int max(int a, int b) {
  return a > b ? a : b;
}

int main() {
  int n, k, ans, r;
  FILE *f = fopen("secventa.in", "r");
  fscanf(f, "%d%d", &n, &k);
  for (int i = 0; i < n; ++i) {
    fscanf(f, "%d", &v[i]);
  }
  fclose(f);
  ans = -INF;
  for (int i = 0; i < n; ++i) {
    if (i - k == dq.front()) {
      dq.pop_front();
    }
    while (!dq.empty() && v[dq.back()] > v[i]) {
      dq.pop_back();
    }
    dq.push_back(i);
    if (i >= k - 1) {
      ans = max(ans, v[dq.front()]);
      r = i;
    }
  }
  f = fopen("secventa.out", "w");
  fprintf(f, "%d %d %d\n", r - k + 2, r + 1, ans);
  fclose(f);
  return 0;
}