#include <bits/stdc++.h>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
long long N, K, A[500005], i, PozU, Max = -30000;
deque<int> Deq;
int main()
{
    f >> N >> K;
    for(i = 1; i <= N; i ++)f >> A[i];

    for(i = 1; i <= N; i ++)
    {
        while(!Deq.empty() && A[Deq.back()] >= A[i])
            Deq.pop_back();
        Deq.push_back(i);
        if(i >= K)
        {
            if(i - Deq.front() + 1 > K)Deq.pop_front();
            if(Max < A[Deq.front()])
            {
                Max = A[Deq.front()];
                PozU = i;
            }
        }
    }
     g << PozU - K + 1 << " " << PozU << " " << Max;
    return 0;
}