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

using namespace std;

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

const int NMAX = 500000 + 1;
const int INF = 1 << 30;
int n, k;
int v[NMAX];
deque <int> D;

void rezolva() {
    int sol = -INF, begin = 0;
    for (int i = 1; i <= n; i++) {
        while (!D.empty() && v[D.back()] > v[i]) D.pop_back();
        D.push_back(i);
        if (i - D.front() >= k) D.pop_front();
        if (i >= k - 1 && v[D.front()] > sol) {
           // cout << 1;
            sol = v[D.front()];
            begin = i - k + 1;
        }
    }
    g << begin << ' ' << begin + k - 1 << ' ' << sol << '\n';
}

void citeste() {
    f >> n >> k;
    for (int i = 1; i <= n; i++) f >> v[i];
}

int main() {
    citeste();
    rezolva();
    return 0;
}