#include <iostream>
#include <fstream>
#include <deque>
#include <vector>
#include <limits>

using namespace std;

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

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

    vector<int>V(N + 1);
    for (int i = 1; i <= N; i++) in >> V[i];

    deque<int> dq;
    int maxMin = numeric_limits<int>::min(), indexLeft = 1, finalStart = 1, finalEnd = 1;
    for (int i = 1; i <= N; i++) {

        while (!dq.empty() && V[i] < V[ dq.back() ]) dq.pop_back();

        dq.push_back(i);

        if (dq.front() == i - K) {
            dq.pop_front();
            indexLeft = dq.front();
        }

        if (dq.front() >= K) {
            if (V[ dq.front() ] > maxMin) {
                maxMin = V[ dq.front() ];
                finalStart = indexLeft;
                finalEnd = i; 
            }
        }
    }

    out << finalStart << " " << finalEnd << " " << maxMin << '\n'; 

    return 0;
}