#include <cstdio>
#include <algorithm>
#include <deque>
#define Dim 500002
#define Bmin -30002

using namespace std;
int n, k, v[Dim], Bmax = Bmin, F, L;
deque <int> d;
void read()
{
    freopen("secventa.in", "r", stdin);
    freopen("secventa.out", "w", stdout);
    scanf("%d %d", &n, &k);
    for(int i = 1; i <= n; ++ i)
        scanf("%d", &v[i]);
}
void solve()
{
    int x;
    for(int i = 1; i <= n; ++ i)
    {
        while(!d.empty() && v[i] < v[d.back()])
        {
            x = d.back();
            d.pop_back();
            if(!d.empty() && i - d.back() - 1 >= k && Bmax < v[x])
            {
                Bmax = v[x];
                F = d.back() + 1;
                L = i - 1;
            }
        }
        d.push_back(i);
    }
    while(!d.empty())
    {
        x = d.back();
        d.pop_back();
        if(!d.empty() && n - d.back() >= k && Bmax < v[x])
        {
            Bmax = v[x];
            F = d.back() + 1;
            L = n;
        }
    }
}
void write()
{
    printf("%d %d %d\n", F, L, Bmax);
}
int main()
{
    read();
    solve();
    write();
    return 0;
}