#include <fstream>

using namespace std;

int n, k, i, j, m[3][500001], inc, fin, maxim;

int main () {
  ifstream fi("secventa.in");
  ofstream fo("secventa.out");
  fi >> n >> k;
  for (i = 1; i <= n; i++)
    fi >> m[0][i];
  for (i = 1; i <= n; i++) {
    for (j = i; j >= 1 and m[0][j] >= m[0][i]; j--);
    m[1][i] = j+1;
    for (j = i; j <= n and m[0][j] >= m[0][i]; j++);
    m[2][i] = j-1;
  }
  for (i = 1; i <= n; i++)
    if (m[0][i] > maxim and m[2][i]-m[1][i]+1 >= k)
      maxim = m[0][i], inc = m[1][i], fin = m[2][i];
  fo << inc << ' ' << fin << ' ' << maxim;
  return 0;
}