#include <iostream>
#include <fstream>
#include <deque>

using namespace std;

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

int N, K;
pair<int, pair<int, int>> ans = {-30100, {0, 0}};
deque<pair<int, int>> dq;

int main()
{
    in >> N >> K;

    for(int i = 1; i <= N; i++)
    {
        int x;
        in >> x;

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

        dq.emplace_back(x, i);

        if(!dq.empty() && dq.front().second <= i - K)
            dq.pop_front();

        //cout << i << ' ' << dq.front().first << '\n';

        if(i >= K && dq.front().first > ans.first)
        {
            ans.first = dq.front().first;
            ans.second = {i - K + 1, i};
        }
    }

    out << ans.second.first << ' ' << ans.second.second << ' ' << ans.first << '\n';

    return 0;
}