#include <bits/stdc++.h>

using namespace std;

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

int main() {
    fin >> n >> k;
    for(i = 1; i < k; i++) {
        fin >> a[i];
        while(!q.empty() && a[q.back()] > a[i]) q.pop_back();
        q.push_back(i);
    }
    for(i = k; i <= n; i++) {
        fin >> a[i];
        while(!q.empty() && a[q.back()] > a[i]) q.pop_back();
        q.push_back(i);

        if(i - q.front() + 1 > k) q.pop_front();    /// cu cat mai mica, cu atat mai micriscul la un nr mic
        if(r < a[q.front()]) r = a[q.front()], p = i - k + 1;
    }
    fout << p << " " << p + k - 1 << " " << r;

    return 0;
}