#include <bits/stdc++.h>
#define int long long
using namespace std;
int v[500005], minn[500005];
signed main()
{
    ifstream cin("secventa.in");
    ofstream cout("secventa.out");
    deque<int> dq;
    int n, k, maxx=-2100000000, pozi;
    cin>>n>>k;
    for(int i=0; i<n; i++)
    {
        cin>>v[i];
    }
    for(int i=0; i<k; i++)
    {
        while(!dq.empty() && v[dq.back()]>v[i])
            dq.pop_back();
        dq.push_back(i);
    }
    minn[0]=v[dq.front()];
    for(int i=k; 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=0; i<n-k+1; i++)
    {
        if(maxx<minn[i])
        {
            maxx=minn[i];
            pozi=i;
        }
    }
    cout<<pozi+1<<" "<<pozi+k<<" "<<maxx;
    return 0;
}