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

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

int n, a[50000], 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 )
        for ( int j = i+k-1; j <n;++j)
        {
            if ( j == i+k-1 )
            {
                m = INT_MAX;
                for ( int t = i; t <=j; ++t )
                    m = min(m, a[t] );
            }
            else
                m = min(m, a[j] );
            if ( m >= M )
            {
                M = m;
                st = i;
                dr = j;
            }
        }
    fprintf(os, "%d %d %d", st+1, dr+1, M );
    fclose(is);
    fclose(os);
    return 0;
}