#include <fstream>
using namespace std;

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

int dq[500004], st, dr, v[500004], n, k, p;

int main()
{
    fin>>n>>k;
    int st=1, dr=0;
    for(int i=1;i<=n;++i) fin>>v[i];
    int maxi=-2000000000;
    for(int i=1;i<=n;++i)
    {
        while(v[dq[dr]]>=v[i]&&dr>=st) dr--;
        dq[++dr]=i;
        if(dq[dr]-dq[st]==k) st++;
        if(v[dq[st]]>maxi&&i>=k)
        {
            p=dq[dr];
            maxi=v[dq[st]];
        }
    }
    fout<<p-k+1<<" "<<p<<" "<<maxi<<"\n";
    return 0;
}