#include <iostream>
#include <deque>
#include <fstream>
#define MIN -30001
using namespace std;

ifstream f ("secventa.in");
ofstream g ("secventa.out");

short v[500005];
int N, k, a, b, best = MIN;
deque < int > deq;

int main()
{
    f >> N >> k;
    for(int i = 1; i <= N; ++i)
        f >> v[i];
    for(int 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 && best < v[deq.front()]) {
            best = v[deq.front()];
            a = i - k + 1; b = i;}
    }
    g << a << " " << b << " " << best;
}