#include <bits/stdc++.h>

using namespace std;

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

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

    return 0;
}