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


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

const int N = 1e5+7;
int l, r, mx = -3e4;
int n, i, k;
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.empty() && deq.front() == i - k)
            deq.pop_front();

        if(mx < v[deq.front()]){
            mx = v[deq.front()];
            l = i - k + 1;
            r = i;
        }else if(mx == v[deq.front()]){
            l = min(l, i - k + 1);
        }else if(l == i - k + 1){
            r = min(r, i);
        }
    }

    fout << l << " " << r << " " << mx;
    return 0;
}