#include <bits/stdc++.h>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
deque <int> dq;
int n,k,a[500001],MAX=-30001,p=1,u,i;
int main()
{
    f>>n>>k;
    for(i=1;i<=n;i++)f>>a[i];
    for(i=1;i<=n;i++)
    {
        while(a[i]<=a[dq.back()] && !dq.empty())
            dq.pop_back();
        dq.push_back(i);
        if(i>=k)
        {
            if(i-dq.front()>=k && !dq.empty())
                dq.pop_front();
            if(a[dq.front()]>MAX){
                u=i;
                MAX=a[dq.front()];}
        }
    }
    g<<u-k+1<<" "<<u<<" "<<MAX;
    return 0;
}