#include <bits/stdc++.h>
#define ll long long
using namespace std;

ifstream fin ( "secventa.in" ) ;
ofstream fout ( "secventa.out" ) ;
int v[500005];
signed main()
{
    int n , k ;
    fin >> n >> k ;

    for ( int i = 1 ; i <= n ; ++ i )
        fin >> v[i];
    int l=0,r=0,max1=INT_MIN;
    for ( int i = 1 ; i <= n ; ++ i )
    {
    priority_queue<int,vector<int>,greater<int>>pq;
    int j = i ;
    while ( j <= i + k - 1 )
        pq.push(v[j++]);
    if ( pq.top() >  max1 )
    {
        l = i ;
        r = i + k - 1 ;
        max1 = pq.top();
    }
    }
    fout << l << ' ' << r << ' ' << max1;
    return 0;
}