#include <fstream>
#include <deque>
#include <cstring>

const int NMAX = 500005;
const int LMAX = 3000005;
const int inf = 0x3f3f3f3f;

using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");

int N,K,A[NMAX],semn,contor,solutie,l,r;
deque <int> Deque;
char s[LMAX];

void citire()
{
    f >> N >> K;
    f.getline(s,LMAX-1);

    f.getline(s,LMAX-1);
    int l = strlen(s);

    int i = 0;
    int nr = 0;
    contor = 1;

    while (i < l)
    {
        if (s[i] == '-')
        {
            semn = -1;
            ++i;
        }
        else semn = 1;

        while (s[i] >= '0' && s[i] <= '9')
        {
            nr = nr*10 + int(s[i]-'0');
            i++;
        }

        A[contor] = nr * semn;
        nr = 0;
        contor++;

        i++;
    }
}

int main()
{
    citire();

    solutie = 0;
    A[0] = -inf;

    for (int i = 1; i <= N; ++i)
    {
        while(!Deque.empty() && A[i] <= A[ Deque.back() ])
        {
            Deque.pop_back();
        }
        Deque.push_back(i);

        if (Deque.front() == i-K)
            Deque.pop_front();

        if (i >= K)
        {
            if (A[ Deque.front() ] > A[solutie])
            {
                solutie = Deque.front();
                r = i;
                l = i-K+1;
            }
        }
    }

    g << l << " " << r << " " << A[solutie];

    f.close();
    g.close();
    return 0;
}