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

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

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

int v[500001];
deque<int> dq;

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

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

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

        dq.push_back(i);

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

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

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