/*
*   @source 'https://infoarena.ro/problema/secventa'
*/

#include <bits/stdc++.h>

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

int n, k;
int tab[100];

int main()
{
    int maxim;
    int maxim_begin;
    int maxim_end;
    int current;

    fin >> n >> k;

    for(int i = 0; i < n; i++) 
    {
        fin >> tab[i];
    }
    
    maxim       = -999999;
    maxim_begin = -1;
    maxim_end   = -1;
    current     = 0;

    for(int i = 0; i < n - k + 1; i++)
    {
        current = *min_element(tab + i, tab + i + k - 1);
        if (maxim < current)
        {
            maxim       = current;
            maxim_begin = i;
            maxim_end   = i + k - 1;
        }
    }

    fout << maxim_begin + 1 << " " << maxim_end + 1 << " " << maxim;

    return 0;
}