#include <fstream>
#include <deque>
#include <climits>

using namespace std;

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

int N, K, maxEl = INT_MIN, st, dr, v[500005];
deque <int> deq;

int main()
{
    fin >> N >> K;
    for(int i = 1; i <= N; i++)
        fin >> 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.back() - deq.front() >= K)
            deq.pop_front();

        if(i >= K)
        {
            if(v[deq.front()] > maxEl)
            {
                maxEl = v[deq.front()];
                st = i - K + 1;
                dr = i;
            }
        }
    }

    fout << st << ' ' << dr << ' ' << maxEl;

    return 0;
}