#include <fstream>
#include <deque>

using namespace std;

ifstream cin("secventa.in");
ofstream cout("secventa.out");

deque <int> d;
int n, k, maxi=-1000000005, st, dr, v[500005];

int main()
{
    cin >> n >> k;
    for(int i=1; i<=n; i++)
    {
        cin >> v[i];
        while(!d.empty() && v[d.back()]>=v[i])
        {
            d.pop_back();
        }
        d.push_back(i);
        if(d.front()==i-k)
        {
            d.pop_front();
        }
        if(i>=k && v[d.front()]>maxi)
        {
            maxi=v[d.front()];
            st=i-k+1;
            dr=i;
        }
    }
    cout << st << " " << dr << " " << maxi;
    return 0;
}