#include <bits/stdc++.h>

using namespace std;

ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n, k, i, a[500002], r, p1, p2;
deque<int> q;

int main() {
    fin >> n >> k;

    for(i = 1; i <= n; i++) fin >> a[i];

    for(i = 1; i < k; i++) {
        while(!q.empty() && a[q.back()] > a[i]) q.pop_back();
        q.push_back(i);
    }
    for(i = k; i <= n; i++) {
        while(!q.empty() && a[q.back()] > a[i]) q.pop_back();
        q.push_back(i);
        if(q.front() == i - k) q.pop_front();
        if(a[q.front()] > r) {
            r = a[q.front()];
            p1 = q.front();
            p2 = i;
        }
    }
    fout << p1 << " " << p2 << " " << r;

    return 0;
}