#include <fstream>
#include <deque>

using namespace std;

ifstream cin("secventa.in");
ofstream cout("secventa.out");

int dr,st,x=2,maxx=0,n,k,v[500005];
deque <int> q;

int main()
{
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>v[i];
        while(q.size()>0 && v[q.back()]>=v[i]){
            q.pop_back();
        }
        q.push_back(i);
        if(i<=k){
            maxx=q.front();
            st=1;
            dr=k;
        }
        while(i-q.front()+1>k && !q.empty()){
            q.pop_front();
        }
        if(v[q.front()]>v[maxx]){
            maxx=q.front();
            st=q.front();
            dr=i;
        }
    }
    cout<<st<<" "<<dr<<" "<<v[maxx];
    return 0;
}
//-1 2 3 1 0 4 8 6