#include <bits/stdc++.h>
using namespace std;

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

int n,k;
int v[500005];
deque<int> q;

int main()
{
    fin>>n>>k;
    for(int i=1; i<=n; i++)
        fin>>v[i];
    for(int i=1; i<=k; i++)
    {
        while(!q.empty() && v[q.back()]>=v[i])
            q.pop_back();
        q.push_back(i);
    }
    int maxim=v[q.front()], st=1, dr=k;
    for(int i=k+1; i<=n; i++)
    {
        while(!q.empty() && v[q.back()]>=v[i])
            q.pop_back();
        q.push_back(i);
        if(i-q.front() >= k)
            q.pop_front();
        if(v[q.front()])
            maxim=v[q.front()], st=i-k+1, dr=i;
    }
    fout<<st<<" "<<dr<<" "<<maxim;
    return 0;
}