#include <cstdio>
using namespace std;
const int NMAX = 500000;
const int NINF = -2.e9;
int v[NMAX + 5] , l[NMAX + 5] , r[NMAX + 5] , st[NMAX + 5];
int main()
{
    freopen("secventa.in" , "r" , stdin);
    freopen("secventa.out" , "w" , stdout);
    int n , i , k , x  , base , top;
    scanf("%d%d" , &n , &k);
    base = NINF;
    top = 0;
    for(i = 1 ; i <= n ; i ++)
    {
        scanf("%d" , &v[i]);
        while(top > 0 && v[st[top]] > v[i])
            top --;
        l[i] = st[top];
        st[++ top] = i;
    }
    st[0] = n + 1;
    top = 0;
    for(i = n ; i >= 1 ; i --)
    {
        while(top > 0 && v[st[top]] > v[i])
            top --;
        r[i] = st[top];
        st[++ top] = i;
    }
    for(i = 1 ; i <= n ; i ++)
    {
        if(r[i] - l[i] - 1 >= k && v[i] > base)
        {
            base = v[i];
            x = l[i] + 1;
        }
    }
    printf("%d %d %d\n" , x , x + k - 1 , base);
    return 0;
}