#include <bits/stdc++.h>

using namespace std;

const int nmax = 500005;
int n, k, v[nmax], sol = -1, soli;
deque< pair<int, int> > q;

int main()
{
    ifstream fin ("secventa.in");
    ofstream fout ("secventa.out");
    fin >> n >> k;
    for (int i = 1; i <= n; ++i)
        fin >> v[i];
    q.push_back({1, v[1]});
    for (int i = 2; i <= n; ++i){
        if(i-q.front().first == k)
            q.pop_front();
        while(!q.empty() && q.back().second >= v[i])
            q.pop_back();
        q.push_back({i, v[i]});
        if(q.front().second > sol){
            sol = q.front().second;
            soli = q.front().first;
        }
    }
    int aux = soli;
    while(v[aux] > v[soli] && soli-aux+1 <= k)
        --aux;
    fout << aux << " " << aux+k-1 << " " << sol << "\n";
    return 0;
}