#include <fstream>
#include <deque>
using namespace std;
ifstream cin("secventa.in");
ofstream cout("secventa.out");
deque<int>d;
int n,k,v[500001],maxi,st,dr;
int main()
{
    cin>>n>>k;
    for(int i=1;i<=n;i++)
        cin>>v[i];
        maxi=-30002;
    for(int i=1;i<=n;i++)
    {
        while(!d.empty()&&v[i]<=v[d.back()])
            d.pop_back();
        d.push_back(i);
        if(i-d.front()+1>k)
            d.pop_front();
        if(i>=k&&maxi<v[d.front()])
        {
            maxi=v[d.front()];
            st=i-k+1;
            dr=i;
        }
    }
    cout<<st<<" "<<dr<<" "<<maxi;
    return 0;
}