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

ifstream is("secventa.in");
ofstream os("secventa.out");

deque<int> d;
int a[500001];
int n, k, sol = -30001;
int ind;

int main()
{
    is >> n >> k;
    for ( int i = 1; i <= n; ++i )
        is >> a[i];
    for ( int i = 1; i <= n; ++i )
    {
        while ( !d.empty() && a[d.back()] > a[i] )
            d.pop_back();

        d.push_back(i);

        while ( d.front() <= i - k )
            d.pop_front();

        if ( i >= k && a[d.front()] > sol )
        {
            sol = a[d.front()];
            ind = i;
        }
    }

    os << ind - k + 1 << ' ' << ind << ' ' << sol << '\n';


	is.close();
	os.close();
	return 0;
}