#include <bits/stdc++.h>

using namespace std;

deque <int> q;
int n, k, x, i;
int maxmin=-30000, poz;
int a[5000003];

int main()
{
    ifstream fin("secventa.in");
    ofstream fout("secventa.out");
    fin >> n >>k;
    for( i =1; i <= n; i++)
        fin >> a[i];

    for(i = 1; i <= k; i++)
    {
        x = a[i];
        while( !q.empty() && x <= a[q.back()])
            q.pop_back();
        q.push_back(i);
    }

    poz=1;
    maxmin=a[q.front()];

    for ( i=k+1; i<= n; i++)
    {

        x = a[i];
        while( !q.empty() && x <= a[q.back()])
            q.pop_back();
        q.push_back(i);
        if(i-q.front() >= k)
           q.pop_front();
        if( a[q.front()] > maxmin )
            maxmin = a[q.front()], poz=q.front();

    }
    fout << poz << " " << poz+k-1 << " " << maxmin;

    return 0;
}