#include <fstream>
#import <algorithm>
#import <vector>
#import <set>
#import <deque>
using namespace std;
#pragma GCC Optimize("Ofast")
main()
{
    ifstream cin("secventa.in");
    ofstream cout("secventa.out");
    int n,k;
    cin>>n>>k;
    deque<int>d;
    ///ce plm de rost are o secv mai mare decat k????
    int rez=-2e9,dr=-1;
    vector<int>a(n+1,0);
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int i=1;i<=n;i++)
    {
        if(!d.empty() && d.front()==i-k)
        {
            d.pop_front();
        }
        while(!d.empty() && a[d.back()]>=a[i])
        {
            d.pop_back();
        }
        d.push_back(i);
        if(a[d.front()]>rez)
        {
            rez=a[d.front()];
            dr=i;
        }
    }
    cout<<dr-k+1<<' '<<dr<<' '<<rez<<'\n';
}