#include <bits/stdc++.h>
using namespace std;

int v[500005],minn[500005];


signed main()
{
    ifstream cin("secventa.in");
    ofstream cout("secventa.out");
    long long int n,k,rez=0,maxnr=0,ci=0;
    cin >> n >> k;
    for(int i=1;i<=n;i++)
    {
        cin >> v[i];
    }
    deque<int> dq;
    for(int i=1;i<=k;i++)
    {
        while(!dq.empty() && v[dq.back()]>v[i])
            dq.pop_back();
        dq.push_back(i);
    }
    minn[1]=v[dq.front()];
    for(int i=k+1;i<=n;i++)
    {
        if(dq.front()<=i-k)
            dq.pop_front();

        while(!dq.empty() && v[dq.back()]>v[i])
            dq.pop_back();
        dq.push_back(i);
        minn[i-k+1]=v[dq.front()];
    }
    for(int i=1;i<=n-k+1;i++)
    {
        if(minn[i]>maxnr)
        {
            maxnr=minn[i];
            ci=i;
        }
    }
    cout << ci << " " << ci+k-1 << " " << maxnr;
    return 0;
}