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