#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
deque<pair<long long,long long>>d;
int main()
{
    ifstream cin("secventa.in");
    ofstream cout("secventa.out");
    long long n,i,k,st,dr,max=0,a;
    cin>>n>>k;
    for(i=1;i<=n;i++){
        cin>>a;
        while(!d.empty() && a<=d.back().first){
              d.pop_back();
        }
        d.push_back(make_pair(a,i));
        while(!d.empty() && d.front().second<=i-k){
              d.pop_front();
        }
        if(d.front().first>max && i>=k){
            max=d.front().first;
            st=i-k+1;
            dr=i;
        }
    }
    cout<<st<<" "<<dr<<" "<<max;
    return 0;
}