#include <fstream>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <stack>
#include <climits>

using namespace std;

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

const int LMAX = 1005;
const int INF = 0x3f3f3f3f;


int main() {
    int n, i, u, v, k, x;
    fin>>n>>k;
    deque<pair<int, int>> dq;
    for (i = 0; i < k - 1; i++) {
        fin>>x;
        while (!dq.empty() && dq.back().first > x) {
            dq.pop_back();
        }
        dq.push_back({x, i});
    }
    v = INT_MIN;
    for (i = k - 1; i < n; i++) {
        fin>>x;
        while (!dq.empty() && dq.back().first > x) {
            dq.pop_back();
        }
        if (dq.front().second == i - k) dq.pop_front();
        dq.push_back({x, i});
        if (v  < dq.front().first) {
            v = dq.front().first;
            u = i + 1;
        }
    }
    fout<<u - k + 1<<" "<<u<<" "<<v;

    fin.close();
    fout.close();
    return 0;
}