#include <deque>
#include <fstream>
using namespace std;
deque <int> dq,pos;
int main ()
{
    ifstream fin ("secventa.in");
    ofstream fout ("secventa.out");
    int n,k,maxim=0;
    fin>>n>>k;
    int nr,v[n];
    for (int i=1;i<=k;++i)
    {
        fin>>nr;
        v[i-1]=nr;
        while (!dq.empty() && dq.back()>=nr)
        {
            dq.pop_back();
            pos.pop_back();
        }
        dq.push_back(nr);
        pos.push_back(i);
    }
    long long int s=dq.front();
    for (int i=k+1;i<=n;++i)
    {
        if (pos.front()==i-k)
        {
            pos.pop_front();
            dq.pop_front();
        }
        fin>>nr;
        v[i-1]=nr;
        while (!dq.empty() && dq.back()>nr)
        {
            pos.pop_back();
            dq.pop_back();
        }
        dq.push_back(nr);
        pos.push_back(i);
        s=dq.front();
        if (maxim<s)
        {
            maxim=s;
        }
    }
    for (int i=0;i<n;++i)
    {
        if (v[i]==maxim)
        {
        int x,y;
        for (x=i;x>0;--x)
        {
            if (v[x-1]<maxim)
            {
                break;
            }
        }
        x++;
        for (y=i;y<n-1;++y)
        {
            if (v[y+1]<maxim)
            {
                break;
            }
        }
        y++;
        fout<<x<<" "<<y<<" "<<maxim;
        break;
        }
    }
}