#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,a[500100],dr,st,maxi=-30001;
int main()
{
    f>>n>>k;
    for(int i=1;i<=n;i++) f>>a[i];
    deque <int> dq;
    for(int i=1;i<=n;i++)
    {   while(!dq.empty()&&a[i]<=a[dq.back()]) dq.pop_back();
        dq.push_back(i);
        if(dq.front()<=i-k) dq.pop_front();
        if(i>=k&&a[dq.front()]>maxi)
        {   maxi=a[dq.front()];
            dr=i;
            st=i-k+1;
        }
    }
    g<<st<<' '<<dr<<' '<<maxi;
    return 0;
}