#include<cstdio>
#include<deque>
#include<fstream>
#define nmax 500010
using namespace std;
deque<int>q;
int n,k,i,x[nmax],crt,sol=-30010;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int main()
{

    fin>>n>>k;
    for(i=1;i<=n;++i)fin>>x[i];
    for(i=1;i<=n;i++)
    {
        while(q.size()&&x[q.back()]>=x[i])
            q.pop_back();
        q.push_back(i);
        if(q.front()==i-k)
            q.pop_front();
        if(i>=k&&x[q.front()]>sol)
        {
            sol=x[q.front()];
            crt=i;
        }
    }
    fout<<crt-k+1<<' '<<crt<<' '<<sol<<'\n';
    return 0;
}