#include <iostream>
#include <fstream>
int n,maxim,v[500000];
long k,i,p,q;
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int main()
{
    fin >>n >> k;
    for (i=1;i<=n;i++) fin >> v[i];
    maxim=v[1];
    for (i=1;i<=n-k+1;i++)
    {
        if (v[i]>maxim) maxim=v[i];

    }
    for (i=1;i<=n-k+1;i++)
    {
        if (v[i]==maxim)
        {
            p=i;
            q=p+k-1;
        }
    }
    fout << p << " " << q << " " << maxim;
    return 0;
}