#include <fstream>
#include <deque>

using namespace std;

ifstream f("secventa.in");
ofstream g("secventa.out");

int main()
{
    int n,k,mi=0,mj=0,mx=0;

    f>>n>>k;

    deque<int> dq,dp;

    for(int i=1;i<=n;i++){
        int x;
        f>>x;

        while(!dp.empty()&&dp.front()<=i-k){
            dp.pop_front();
            dq.pop_front();
        }

        while(!dq.empty()&&x<dq.back()){
            dp.pop_back();
            dq.pop_back();
        }
        dq.push_back(x);
        dp.push_back(i);

        if(i>=k&&dq.front()>mx)
            mx=dq.front(),mi=di-k+1,mj=i;
    }

    g<<mi<<" "<<mj<<" "<<mx;

    return 0;
}