#include <iostream>
#include <fstream>
#include <deque>
#include <algorithm>
using namespace std;
int main() {
    deque<pair <int, int> > deq;
    fstream f1, f2;
    f1.open("secventa.in", ios::in);
    int n, k, mat, i, max, start;
    f1>>n>>k;
    for(i=1; i<=k; i++) {
             f1>>mat;
             while(!deq.empty() && mat<=deq.back().first) {
                              deq.pop_back();
             }
             deq.push_back(make_pair(mat, i));
    }
    start=1; max=deq.front().first;
    for(i=k+1; i<=n; i++) {
               f1>>mat;
               if(deq.front().second<=i-k) { deq.pop_front(); }
               while(!deq.empty() && mat<=deq.back().first) {
                              deq.pop_back();
               }
               deq.push_back(make_pair(mat, i)); 
               if(deq.front().first>max) { 
                                         max=deq.front().first; 
                                         start=i-k+1;
                                         }
    }
    f2.open("secventa.out", ios::out);
    f2<<start<<" "<<start+k-1<<" "<<max;
    f1.close(); f2.close();          
    return 0;
}