#include <cstdio>
#include <cctype>
#include <deque>

using namespace std;

const int nmx = 500002;
const int inf = 0x3f3f3f3f;

int n,k;
int v[nmx];
int maxim = -inf, pos;
char s[3550000];
deque <pair<int,int> > dq;

void parsare()
{
    scanf("%d %d\n", &n, &k);
    gets(s);

    int total = 0;

    int p = 0, nr, semn;

    while(total < n)
    {
        while(not isdigit(s[p]))
            ++p;

        nr = 0;

        if(p > 0 && s[p-1] == '-')
            semn = -1;
        else
            semn = 1;

        while(isdigit(s[p]))
            {
                nr = nr * 10 + (int) s[p] - '0';
                ++ p;
            }

        v[++total] = nr;

        if(semn == -1)
            v[total] *= -1;
    }
}

int main()
{
    freopen("secventa.in", "r", stdin);
    freopen("secventa.out", "w", stdout);

    parsare();

    for(int i = 1; i <= n; ++i)
    {
        int nr = v[i];

        while(not dq.empty() && dq.front().first > nr)
            dq.pop_front();

        dq.push_front(make_pair(nr,i));

        if(not dq.empty() && dq.back().second <= i - k)
            dq.pop_back();

        if(i >= k && dq.back().first > maxim)
        {
            maxim = dq.back().first;
            pos = i;
        }
    }

    printf("%d %d %d\n", pos - k + 1, pos, maxim);

    return 0;
}