#include <fstream>
#include <deque>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
deque<int> B;
int n,k,a[500001];
int vmax,vf,vs;
int main()
{   f>>n>>k;
    for(int i=1;i<=n;i++)
    {   f>>a[i];
        while(!B.empty() and a[B.front()]>a[i])
            B.pop_front();
        B.push_front(i);
        if(!B.empty() and i-B.back()>=k)
           B.pop_back();
        if(i>=k)
        {   if(a[B.back()]>vmax)
            {   vmax=a[B.back()];
                vf=i;
                vs=i-k+1;
            }
        }
    }
    g<<vs<<' '<<vf<<' '<<vmax;
    return 0;
}