#include <iostream>
#include <cstdio>
using namespace std;
#include <deque>
int l,n,k,x,i,mx=-300000,p;
int main()
{
    deque<int> a,b;
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    cin>>n>>k;
    a.push_back(-300000);
    b.push_back(30000000);
    for (i=1;i<=n;i++)
    {
        cin>>x;
        if (i-b[1]==k)
        {
            if (a[1]>mx)
                {
                    mx=a[1];
                    p=b[1];
                }
            a.pop_front();
            b.pop_front();
            a.pop_front();
            b.pop_front();
            a.push_front(-300000);
            b.push_front(30000000);
        }
        while (x<=a[l])
        {
            l--;
            a.pop_back();
            b.pop_back();
        }
        a.push_back(x);
        b.push_back(i);
    }
    if (i-b[1]==k)
        {
            if (a[1]>mx)
                {
                    mx=a[1];
                    p=b[1];
                }
            a.pop_front();
            b.pop_front();
            a.pop_front();
            b.pop_front();
            a.push_front(-300000);
            b.push_front(30000000);
        }
    cout<<p<<" "<<p+k-1<<" "<<mx;
}