#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
int n,k,i,x,ps,maxZ,st,dr;
deque<int> d;
int main()
{
    ifstream fin ("secventa.in");
    ofstream fout ("secventa.out");
    fin>>n>>k;
    ps=k;
    maxZ=-30001;
    for (i=1;i<=n;++i){
        fin>>x;
        if (ps==0)
            d.pop_back();
        while(x<d.front()&&!d.empty()){
            d.pop_front();
            ++ps;}
        d.push_front(x);
        --ps;
        if (d.back()>=maxZ){
            maxZ=d.back();
            dr=i;
            st=i-k+1;}
    }
fout<<st<<" "<<dr<<" "<<maxZ;
    return 0;
}