#include <bits/stdc++.h>
using namespace std;

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

int n, k, x, first, last, mmin{-100000};

deque<pair<int, int>> dq;

int main()
{
    fin >> n >> k;

    for(int i = 1; i <= n; i++){
        fin >> x;

        while(!dq.empty() && dq.back().first >= x) dq.pop_back();

        dq.push_back(make_pair(x, i));

        if(dq.front().second == i - k) dq.pop_front();

        if(i >= k){
            if(dq.front().first > mmin){
                mmin = dq.front().first;
                last = i;
                first = i - k + 1;
            }
        }
    }

    fout<<first<<" "<<last<<" "<<mmin;
}