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

#ifdef INFOARENA
    ifstream in("secventa.in");
    ofstream out("secventa.out");
#else
    #define out cout
    #define in cin
#endif

const int INF = 1 << 30;
int N, K;
deque<pair<int, int> > dq;

int main() {
    in >> N >> K;
    int best = -INF, a = 0, b = 0;
    for (int i = 1, x; i <= N; ++i) {
        in >> x;
        if (dq.size() < K) {
            dq.push_back(make_pair(x, i));
        } else {
            while (!dq.empty() && dq.back().first > x) {
                dq.pop_back();
            }
            dq.push_back(make_pair(x, i));
            if (i - dq.front().second + 1 > K) {
                dq.pop_front();
            }

            if (dq.front().first > best) {
                best = dq.front().first;
                a = dq.back().second - K + 1;
                b = dq.back().second;
            }
        }
    }

    out << a << ' ' << b << ' '  << best;
    return 0;
}