#include <iostream>
#include <fstream>
using namespace std;
int n,k,p1,v[500009],mx,p2,p;
int main()
{
    ifstream f("secventa.in");
    ofstream g("secventa.out");
    f>>n>>k;
    for (int i=1;i<=n;i++)
    {

        f>>v[i];
        if(i<=n-k+1&&v[i]>mx){mx=v[i];p=i;}
    }
    p1=p2=p;
    while(v[p1-1]>=v[p]&&p1>1)p1--;
    while(v[p2]>=v[p]&&p2<n)p2++;
    g<<p1<<" "<<p2<<" "<<mx;
    return 0;
}