//
//  main.cpp
//  secventa
//
//  Created by Andrada Minca on 20.02.2025.
//

#include <fstream>
#include <deque>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n,k,m=-30001,is,v[500005];
deque <int> q;
int main()
{
    fin>>n>>k;
    q.push_front(0);
    v[0]=-30000;
    for(int i=1;i<=n;i++)
    {
        fin>>v[i];
        while(!q.empty()&&q.back()<=i-k)q.pop_back();
        while(!q.empty()&&v[i]<v[q.front()])q.pop_front();
        q.push_front(i);
        if(v[q.back()]>m&&i>=k)
        {
            m=v[q.back()];
            is=i;
        }
    }
    fout<<is-k+1<<" "<<is<<" "<<m;
    return 0;
}