#include<fstream>
#include<deque>

using namespace std;

ifstream fin( "secventa.in" );
ofstream fout( "secventa.out" );

const int inf = 1 << 30;
const int nmax = 500000;
int v[ nmax + 1 ];
deque <int> d;

int main() {
    int n, k, sol, x;
    fin >> n >> k;
    for( int i = 0; i < k - 1; ++ i ) {
        fin >> v[ i ];
        d.push_back( i );
    }
    sol = -inf;
    for( int i = k - 1; i < n; ++ i ) {
        fin >> v[ i ];
        while ( !d.empty() && v[ d.back() ] > v[ i ] ) {
            d.pop_back();
        }
        d.push_back( i );
        if ( i - d.front() >= k ) {
            d.pop_front();
        }

        if ( v[ d.front() ] > sol ) {
            sol = v[ d.front() ];
            x = i - k + 1;
        }
    }

    fout << x + 1 << ' ' << x + k << ' ' << sol << "\n";

    fin.close();
    fout.close();
    return 0;
}