#include <fstream>
#include <queue>

using namespace std;

ifstream fin("secventa.in");
ofstream fout("secventa.out");

const int nmax=500000;

int v[nmax+1];

deque <int> dq;

int main(){
    int n,m;
    fin>>n>>m;
    for(int i=1;i<=n;i++){
        fin>>v[i];
    }
    for(int i=1;i<=m-1;i++){
        while(dq.empty()==0&&v[i]<v[dq.front()]){
            dq.pop_front();
        }
        dq.push_back(i);
    }
    int maxi=0,maxii=0;
    for(int i=m;i<=n;i++){
        while(dq.empty()==0&&v[i]<v[dq.front()]){
            dq.pop_front();
        }
        dq.push_back(i);
        if(dq.front()<=i-m){
            dq.pop_front();
        }
        if(v[dq.front()]>maxi){
            maxi=v[dq.front()];
            maxii=i;
        }
    }
    fout<<maxii-m+1<<" "<<maxii<<" "<<maxi<<"\n";
    return 0;
}