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

ifstream f("secventa.in");
ofstream g("secventa.out");
const int N=500010;
int v[N],n,k,st,dr,j,i,a,d[N],maxim,min_dr,min_st;

int main()
{
    f>>n>>k;
    st=0;
    dr=-1;
    maxim=-30010;
    min_st=n+1;
    min_dr=n+1;
    for(i=1; i<=n; i++)
    {
        f>>v[i];
        if(st<=dr && d[st]==i-k)
        {
            st++;
        }
        while(st<=dr && v[i]<=v[d[dr]])
        {
            dr--;
        }
        d[++dr]=i;

        if (i >= k && v[d[st]] > maxim)
        {
            maxim = v[d[st]];
            min_st=i-k+1;
            min_dr=i;
        }
        /*
        else if(v[d[st]]==maxim)
        {
            min_st=min(min_st,i-k+1);
            min_dr=min(min_dr,i);
        }
        */
    }
    g<<min_st<<" "<<min_dr<<" "<<maxim;
    return 0;
}