#include <bits/stdc++.h>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");

deque< pair <int, int> >v;
int n, k, x, a[500005], sol=INT_MIN, indsol ;

int main() {
    fin>>n>>k;
    for(int i=1; i<=n; i++){
        fin>>a[i];
        while(!v.empty() &&v.front().second>a[i])
            v.pop_front();
        v.push_back(make_pair(i, a[i]));
        if(v.front().first==i-k)
            v.pop_front();
        if(v.front().first>=k)
            if(v.front().second>=sol)
        {
            sol=v.front().second;
            indsol=i;
        }
    }
    fout<<indsol-k+1<<" "<<indsol<<" "<<sol<<'\n';;
    return 0;
}