#include<fstream>
#include<deque>

using namespace std;

ifstream f("secventa.in");
ofstream g("secventa.out");

int main () {
int best=-32002;
deque<int>q;
int n,i,k;
int v[500007];

int si,sf;
    f>>n>>k;

    for(i=1;i<=n;++i){
        f>>v[i];

    }
    for(i=1;i<=n;++i){

        while(!q.empty() &&v[q.back()]>=v[i]) {
            q.pop_back();
        }
        q.push_back(i);
        if(q.front()==i-k){
            q.pop_front();
        }
        if(k<=i) {
            if(best<v[q.front()]){
                best=v[q.front()];

                sf=i;
            }
        }
    }
    g<<sf-k+1<<" "<<sf<<" "<<best<<"\n";
    return 0;
}