//se incearca evitarea dequelui, cea mai tare structura de date...
#include <iostream>
using namespace std;

int st[500003], dr[500003], v[500003];
int sv[500003];
signed main()
{
    int n, k, i, top = 0;
    cin >> n >> k;
    for (i = 1; i <= n; i++)
    {
        cin >> v[i];
        while (top and v[sv[top]] > v[i])
            top--;
        st[i] = sv[top];
        sv[++top] = i;
    }
    top = 0;
    for (i = n; i >= 1; i--)
    {
        while (top and v[sv[top]] > v[i])
            top--;
        if (sv[top] == 0)
            dr[i] = n + 1;
        else
            dr[i] = sv[top];
        sv[++top] = i;
    }/*
    for (i = 1; i <= n; i++)
        cout << st[i] << " ";
    cout << "\n";
    for (i = 1; i <= n; i++)
        cout << dr[i] << " ";
    return 0;*/
    int ans = -300003;
    int a, b;
    a = b = 0;
    for (i = 1; i <= n; i++)
    {
        if (dr[i] - st[i] - 1 >= k)
        {
            if (ans < v[i])
            {
                ans = v[i];
                a = st[i] + 1;
                b = dr[i] - 1;
            }
        }
    }
    cout << a << ' ' << b << " " << ans;
}