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

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

int n, k;
int a[500005];
int be, en, ma;
deque<int> q;

int main()
{
    is >> n >> k;
    for ( int i = 1; i <= n; ++i )
        is >> a[i];
    for ( int i = 1; i <= n; ++i )
    {
        while ( !q.empty() && a[i] >= a[q.back()] && i - q.front() > k - 1 )
            q.pop_back();
        q.push_back(i);
        while ( !q.empty() && i - q.front() > k - 1 )
            q.pop_front();
        if ( i - q.front() + 1 == k && q.front() > ma )
        {
            ma = a[q.front()];
            be = q.front();
            en = i;
        }
    }
    os << be << " " << en << " " << ma;
    is.close();
    os.close();
    return 0;
}