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