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