#include <fstream>
#include<deque>
#include<vector>
using namespace std;
#define Nmax 500005
int n,k,poz,i;
int a[Nmax];
deque<int> dq;
ifstream f("secventa.in");
ofstream g("secventa.out");

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

    for(;i<=n;i++)
    {
        f>>a[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(max<a[dq.front()])
            {max=a[dq.front()];poz=i;}
    }
    g<<poz-k+1<<' '<<poz<<' '<<max;

    return 0;
}