#include <bits/stdc++.h>

using namespace std;

const int MAXN = 500005;

int v[MAXN];
deque<int> dq;

int main()
{
    ifstream fin("secventa.in");
    ofstream fout("secventa.out");
    int n, k;
    fin >> n >> k;
    for(int i = 1; i <= n; ++i)
        fin >> v[i];
    int maxim = -1e9, ans = 0;
    for(int i = 1; i <= n; ++i){
        while(!dq.empty() && v[i] < v[dq.back()])
            dq.pop_back();
        if(!dq.empty() && dq.front() + k - 1 < i)
            dq.pop_front();
        dq.push_back(i);
        if(i >= k && v[dq.front()] > maxim){
            maxim = v[dq.front()];
            ans = dq.front();
        }
    }
    fout << ans << " " << ans + k - 1 << " " << maxim;
    return 0;
}