#include <iostream>
#include <fstream>
#include <cstring>
#include <cstdlib>
#include <deque>
using namespace std;
char s[4000001],*p;
int A[500001],n,k,Min,m;
deque<int> D;
int main()
{
    Min = -30001;
    ifstream f("secventa.in");
    f>>n>>k;
    f.get();
    f.getline(s,sizeof(s),EOF);
    f.close();
    p=strtok(s," ");
    m=0;
    while(p)
    {
        A[++m]=atoi(p);
        p=strtok(NULL," ");
    }
    for(int i=1;i<=n;i++)
    {
        while(!D.empty()&&A[i]<=A[D.back()])D.pop_back();
        D.push_back(i);
        if(D.front()==i-k)D.pop_front();
        if(i>=k&&A[D.front()]>Min)Min=A[D.front()],m=i;
    }
    ofstream g("secventa.out");
    g<<m-k+1<<" "<<m<<" "<<Min;
    g.close();
    return 0;
}