#include <iostream>
#include <fstream>
#include <queue>

using namespace std;

ifstream fin("secventa.in");
ofstream fout("secventa.out");

deque<int>dq;
int n, k, a[500008], lg=0, max_min=-1e9, st=0, dr=0;

int main()
{
    fin>>n>>k;
    for (int i=1;i<=n;i++)
    {
        fin>>a[i];
    }

    for (int i=1;i<=n;i++)
    {
        while (!dq.empty() && a[dq.back()]>a[i])
        {
            dq.pop_back();
        }
        dq.push_back(i);

        if (dq.front()==i-k)
        {
            dq.pop_front();
        }

        if (i>=k &&max_min<a[dq.front()])
        {
            max_min=a[dq.front()];
            dr=i;
            st=i-k+1;

        }
        
    }
    fout<<st<<' '<<dr<<' '<<max_min;
}