#include <cstdio>
#include <algorithm>
#include <climits>
using namespace std;

FILE* is = fopen("secventa.in", "r" );
FILE* os =fopen("secventa.out", "w" );

int n, a[500000], k, m, M=INT_MIN, st, dr;

int main()
{
    fscanf(is, "%d%d", &n, &k );
    for ( int i =0; i < n; ++i )
        fscanf(is, "%d", &a[i]  );
    for ( int i = 0; i <= n-k+1; ++i )
    {
        m = INT_MAX;
        for ( int j = i; j < i+k;++j)
            m = min(m, a[j] );
        if ( m > M )
        {
            M = m;
            st = i+1;
            dr = i+k;
        }
    }
    fprintf(os, "%d %d %d", st, dr, M );
    fclose(is);
    fclose(os);
    return 0;
}