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

int main()
{
    int n, k, v[500001], max=0, d[500001], p1, p2, i, st, dr;
    ifstream f ("secventa.in");
    ofstream g ("secventa.out");
    f>>n>>k;
    for (i=1; i<n; i++) f>>v[i];
    st=1;
    dr=0;
    for (i=1; i<n; i++)
    {
        if (st<=dr && d[st]==i-k)
        {
            st++;
        }
        while (st<=dr && v[i]>=v[d[dr]])
        {
            dr--;
        }
        d[++dr]=i;
        if (max<v[d[dr]] && i<=n-k+1)
        {
            max=v[i];
            p1=i;
            p2=i+k-1;
        }
    }
    g<<p1<<" "<<p2<<" "<<max;
}