#include <bits/stdc++.h>

using namespace std;
ifstream f ("secventa.in");
ofstream g ("secventa.out");
int main()
{
    deque <pair <int , int>> d;
    int n,k,i,x,mx=-30001,mxi,mxs;
    f >> n >> k;
    for(i=1; i<=n; i++) {
        f >> x;
        while(!d.empty() and x<=d.front().first)
            d.pop_front();
        d.push_front(make_pair(x,i));
        if(d.back().second<i-k+1)
            d.pop_back();
        if(i>=k and d.back().first>mx) {
            mx=d.back().first;
            mxs=i;
        }
    }
    g << mxs-k+1 << " " << mxs << " " << mx;
    return 0;
}