# include <deque>
# include <fstream>
# define NMAX 500001
# define VAL -30001

using namespace std;

int N, K, pmax = VAL, p;
int A[NMAX];

ifstream fin("secventa.in");
ofstream fout("secventa.out");

int main()
{
    fin >> N >> K;
    deque<int> Q;
    for(int i = 1; i <= N; ++ i)
    {
        fin >> A[i];
        while(Q.size() && A[i] <= A[Q.back()])
            Q.pop_back();
        Q.push_back(i);
        if(i-K == Q.front()) Q.pop_front();
        if(i >= K && pmax < A[Q.front()])
            pmax = A[Q.front()], p = i;
    }
    fout << p-K+1 << ' ' << p << ' ' << pmax << '\n';
    return 0;
}