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