#include <fstream>
#include <deque>

#define in "secventa.in"
#define out "secventa.out"
#define Max_Size 500009

std :: ifstream f(in);
std :: ofstream g(out);

int N, K;
int Beg, End, Base = -30009;
int A[Max_Size];

std :: deque < int > DQ;

inline void Read_Data()
{
    f >> N >> K;
    for(int i = 1; i <= N; ++i) f >> A[i];
}

inline void Solve()
{
    for(int i = 1; i <= N; ++i)
    {
        while(!DQ.empty() && A[DQ.back()] >= A[i])  DQ.pop_back();
        DQ.push_back(i);

        if(i - DQ.front() + 1 > K)  DQ.pop_front();

        if(A[ DQ.front() ] > Base)
        {
            Base = A[ DQ.front() ];
            Beg = i - K + 1;
            End = i;
        }
    }
}

int main()
{
    Read_Data();
    Solve();

    g << Beg << ' ' << End << ' ' << Base << '\n';

    g.close();
    return 0;
}