#include <bits/stdc++.h>

#define deb(x) << "[" << #x << " = " << x << "]"

using namespace std;

ifstream in("secventa.in");
ofstream out("secventa.out");

using ll = long long;

const int inf = (int)1e9 + 8;
const int maxN = (int)5e5 + 5;

int n, k;

int v[maxN];

int main() {
  in.tie(NULL);
  in >> n >> k;
  deque<int> dq;
  int ans = -inf;
  pair<int, int> pos;
  for (int i = 1; i <= n; i++) {
    in >> v[i];
    while ((int)dq.size() > 0 && v[dq.back()] >= v[i]) {
      dq.pop_back();
    }
    dq.push_back(i);
    if (i >= k) {
      if (v[dq.front()] > ans) {
        ans = v[dq.front()];
        pos = make_pair(i - k + 1, i);
      }
    }
    if (dq.front() <= i - k + 1) {
      dq.pop_front();
    }
  }
  out << pos.first << " " << pos.second << " " << ans << "\n";
  return 0;
}