#include <fstream>
#include <deque>
using namespace std;

ifstream cin("secventa.in");
ofstream cout("secventa.out");
deque <int> dq;
int n, k, a[500005], i, maxi=-((1<<31)-1), st, dr;
inline int max(int a, int b)
{
    if(a>b) return a;
    return b;
}
int main()
{
    cin>>n>>k;
    for(i=1;i<=n;++i)
        {
            cin>>a[i];
            while(!dq.empty() && a[dq.back()]>=a[i])
                dq.pop_back();
            dq.push_back(i);
            if(i>k && dq.front()==i-k)
                dq.pop_front();
            if(i>=k)
                if(maxi<a[dq.front()])
                    {
                        maxi=a[dq.front()];
                        st=i-k+1;
                        dr=i;
                    }
        }
    while(a[st-1]>=maxi && st>1)
        st--;
    cin.close();
    cout<<st<<" "<<dr<<" "<<maxi<<"\n";
    cout.close();
    return 0;
}