#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int i,x,y,v[500002],p,u,maxi,n,m;
deque <int> q;
int minim(int k,int p,int secv[])
{
    int minn=secv[k];
    for(int i=k;i<p;i++)
    {
        if(secv[i]<minn)
            minn=secv[i];
    }
    return minn;
}
int main()
{
    fin>>n>>m;
    for(i=0;i<n;i++)
    {
        fin>>v[i];
    }
    for(i=0; i<n; i++) {
        while(!q.empty() && v[i]<v[q.back()])
            q.pop_back();
        q.push_back(i);
        if(q.front()==i-m)
            q.pop_front();
        if(maxi<v[q.front()] && i>=m) {
            maxi=v[q.front()];
            p=i-m+2;
            u=i+1;
            maxi=v[q.front()];
        }
    }
    fout<<p<<" "<<u<<" "<<maxi<<'\n';
    return 0;
}