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

int v[500001], d[500001];

int main()
{
    int n, k, p1, p2, i, st, dr, max=0;
    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[st]] && i >= k)
        {
            max=v[d[st]];
            p1 = i - k + 1;
            p2 = i;
        }
    }
    g<<p1<<" "<<p2<<" "<<max;
}