#include <iostream>
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
deque<long int> dq;
int v[500010];
long int n,k,x,st,dr;
int main()
{
    fin >> n >> k;

    for(int i = 1; i <=n; i++){
        fin >> v[i];
    };
    for(int i = 1; i <=k; i++){

        while(!dq.empty() && v[dq.back()] >= v[i]){
            dq.pop_back();
        };
        dq.push_back(i);
    };
    long long int maxv = v[dq.front()];
    for(int i = k+1; i <=n; i++){
        if(!dq.empty() && dq.front() == i-k){
            dq.pop_front();
        };
        while(!dq.empty() && v[dq.back()] >= v[i]){
            dq.pop_back();
        };
        dq.push_back(i);
        if(maxv < v[dq.front()]){
            maxv = v[dq.front()];
            st = i-k+1;
            dr = i;

        }
    };
    fout << st << " " << dr << " "<< maxv;
return 0;

}