#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);

    for(int i=1;i<=n;i++)
    {
      while(!q.empty()&&a[q.back()]>a[i])
            q.pop_back();
        q.push_back(i);

        if(q.front()<=i-k)
            q.pop_front();

        if(i>=k&&Max<a[q.front()])
        {
            Max=a[q.front()];
            Maxp=i-k+1;
        }
    }
    g << Maxp << " " << Maxp+k-1 << " " << Max << "\n";

    return 0;
}