#include<iostream>
#include<fstream>
#include<deque>
#include<utility>
#include<algorithm>
using namespace std;

ifstream fin("secventa.in");
ofstream fout("secventa.out");

int main(){
    int i;
    long int a, n, k;
    fin>>n>>k;
    deque<pair<long int, long int> > d(n);
    int f, fi;
    fi = 1;
    fin>>a;
    d[0] = make_pair(a,0);
    for(i = 1; i< k; ++i){
        fin>>a;
        pair<long int, long int> p;
        p  = make_pair(a,i);
        f = fi -1;
        while (a< d[f].first && f>=0 ) {
            d[f+1] = d[f];
            f--;
        }
        d[f+1] = p;
        ++fi;
    }
   
    fi = k;
    int init = 1;
    long int bM = d[0].first;
    long int bidx = 0;
    for(;i<n; i++){
        
        fin>>a;
        f = fi -1;
        while(a < d[f].first && f >=0){
            d[f+1] = d[f];
            f--;
        }
        d[f+1] = make_pair(a,i);
        ++fi;
        while (d[init].second < i - (k-1)) ++init;
        if(d[init].first > bM){
        bM = d[init].first;
        bidx = init;
        }
    }

       fout<<bidx + 1<<" "<<bidx + k<<" "<<bM;
}