#include <iostream>
#include <fstream>
#include <deque>
using namespace std;

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

const int N = 5e5 + 7;
int n, i, k, mx = -3e4, l, r;
int v[N];

deque <int> deq;

int main()
{
    fin >> n >> k;
    for(i = 1; i <= n; i++){
        fin >> v[i];
    }
    for(i = 1; i <= n; i++){
        while(!deq.empty() && v[i] <= v[deq.back()]){
            deq.pop_back();
        }

        deq.push_back(i);

        if(deq.front() == i - k){
            deq.pop_front();
        }
        if(i >= k && mx < v[deq.front()]){
            mx = v[deq.front()];
            l = deq.front();
            r = i;
        }
    }
    fout << l << " " << r << " " << mx;
    return 0;
}