#include <bits/stdc++.h>

using namespace std;
ifstream fin ("secventa.in");
ofstream fout ("secventa.out");
int n,k,v[500005],i,pmax;
deque <int> q;
int main()
{
    fin>>n>>k;
    for (i=1;i<=n;i++) fin>>v[i];
    pmax=0;
    for (i=1;i<=n;i++)
        {
            if (!q.empty() && i-q.front()>=k) q.pop_front();
            while (!q.empty() && v[q.back()]>=v[i]) q.pop_back();
            q.push_back(i);
            if (v[q.front()]>v[pmax]) pmax=q.front();
        }
    if (pmax<=n-k+1) fout<<pmax<<" "<<pmax+k-1<<" "<<v[pmax];
    else fout<<n-k+1<<" "<<n<<" "<<v[pmax];
    return 0;
}