#include <iostream>
#include <fstream>
#include <deque>
using namespace std;

long int n, k, i, a[500001], l;
deque <int> d;
ifstream f("secventa.in");
ofstream g("secventa.out");

int main()
{f>>n>>k;
for(i=1; i<=n; ++i) f>>a[i];
for(i=1; i<=n; ++i)
{
    while(d.size() && a[d.back()]<a[i] && i-d.front()>=k) d.pop_back();
    d.push_back(i);
    if(d.back()-d.front()>=k) l=d.back()-d.front();
}
g<<d.front()<<" "<<d.back()<<" "<<l;
g.close();
f.close();
return 0;
}