#include <bits/stdc++.h>

using namespace std;
ifstream f ("secventa.in");
ofstream g ("secventa.out");
int main()
{
    deque <int> poz,val;
    int n,k,i,x,mx=-30001,mxi,mxs;
    f >> n >> k;
    for(i=1; i<=n; i++) {
        f >> x;
        if(val.front()>x) val.push_front(x);
        else {
            val.push_back(x);
            val.pop_front();
            poz.pop_front();
        }
        poz.push_back(i);
        if(poz.back()-poz.front()+1>=k) {
            mx=max(mx,val.front());
            mxi=poz.front();
            mxs=poz.back();
        }
    }
    g << mxi << " " << mxs << " " << mx;
    return 0;
}