#include <fstream>
using namespace std;

ifstream fin("secventa.in");
ofstream fout("secventa.out");

const int maxn = 500001;

int n, k, nr, min1=-30001, st, dr, Front=1, Back;
int v[maxn], Deque[maxn];

int main()
{
    fin>>n>>k;
    for(int i=1; i<=n; i++)
    {
        fin>>v[i];

        while(Front<=Back&&v[i]<=v[Deque[Back]]) Back--;

        Deque[++Back]=i;

        if(Deque[Front]==i-k) Front++;

        if(i>=k)
        {
            if(v[Deque[Front]]>min1)
            {
                min1=v[Deque[Front]];
                st=Deque[Front];
                dr=i;
            }
        }
    }
    fout<<st<<' '<<dr<<' '<<min1;
    return 0;
}