#include <iostream>
#include <fstream>
#include <deque>
#include <climits>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int a[500010],n,k,Max=INT_MIN,pos[500010],Maxp;
deque <int> q;
int main()
{
    f>> n >> k;
    int p;
    for(int i=1;i<=n;i++)
        f >> a[i];
    q.push_back(1);
    Max=a[1];
    Maxp=1;
    for(int i=2;i<=n;i++)
    {
        p=q.front();
        while(p<=i-k && !q.empty())
        {
           // cout << q.front()  << " " << i<< "\n";
            q.pop_front();
            p=q.front();
        }

       // cout << a[i] << " "<< a[q.front()] << " " << a[q.back()] << "\n";

        if(a[i]<=a[q.front()])
        {
            q.push_front(i);
        }else {
            p=q.back();
            while(a[p]>=a[i] &&!q.empty())
            {
                q.pop_back();
                p=q.back();
            }
            q.push_back(i);
        }
        if(i>=k && Max<a[q.front()]){
            Max=a[q.front()];
            Maxp=q.front();
        }
    }
    g << Maxp << " " << Maxp+k-1 << " " << Max << "\n";

    return 0;
}