#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
deque<int> D;
int n,k,Min,m,A[500001];
int main()
{
    ifstream f("secventa.in");
    f>>n>>k;
    for(int i=1;i<=n;i++)
    {
        f>>A[i];
        while(!D.empty()&&A[i]<=A[D.back()])D.pop_back();
        D.push_back(i);
        if(D.front()==i-k)D.pop_front();
        if(i>=k&&A[D.front()]>=Min)Min=A[D.front()],m=i;
    }
    f.close();
    ofstream g("secventa.out");
    g<<m-k+1<<" "<<m<<" "<<Min;
    g.close();
    return 0;
}