#include <fstream>
#include <iostream>
#include <deque>
using namespace std;

const int kMaxN = 500005;

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

int el[kMaxN];
deque<int> deq;

int main() {
    int n, k;
    in >> n >> k;

    int mx = -0x3f3f3f3f;
    for (int i = 1; i <= n; ++i)
        in >> el[i];
    int c_dr;
    for (int i = 1; i <= n; ++i) {
        if (deq.front() == i - k)
            deq.pop_front();
        while (deq.size() and el[deq.back()] >= el[i])
            deq.pop_back();
        deq.push_back(i);
        int act = el[deq.front()];
        if (i >= k and mx < act) {
            c_dr = i;
            mx = act;
        }
    }
    out << c_dr - k + 1 << ' ' << c_dr << ' ' << mx << '\n';
    return 0;
}