#include <fstream>
#include <deque>

using namespace std;

#define INFILE "secventa.in"
#define OUTFILE "secventa.out"
#define ll long long

ifstream fin (INFILE);
ofstream fout (OUTFILE);

ll n, k, v[5000005], min_max = -300001, poz;
deque <int> dq;

void solve(){

    fin >> n >> k;

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

        while (!dq.empty() && v[i] <= v[dq.back()]){
            dq.pop_back();
        }

        dq.push_back(i);

        if(i >= k){

            if (!dq.empty() && i - dq.front() >= k){
                dq.pop_front();
            }
                
            if (v[dq.front()] > min_max){

                poz = i;
                min_max = v[dq.front()];

            }
        }
    }

    fout << poz - k + 1 << " " << poz << " " << min_max;
}

int main(){
    solve();
    return 0;
}