#include <bits/stdc++.h>

using namespace std;

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

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

    int n, k;  fin >> n >> k;


    int p_max_min = 1, first, last;


    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 && v[dq.front()] > v[p_max_min])
        {
            p_max_min = dq.front();
            last = i;
            first = i - k + 1;
        }
    }

    fout << first << " " << last << " " << v[p_max_min];
}