#include <fstream>
#include<deque>
using namespace std;
ifstream cin("secventa.in");
ofstream cout("secventa.out");

int n, k, sol, a[500050];
long long s, inceput, sfarsit;
deque<int> d;
int main()
{
    int i;
    sol=-30010;
    cin>>n>>k;
    for(i=1;i<=n;i++)
{    cin>>a[i];

        while(!d.empty() && a[i]<=a[d.back()])
        d.pop_back();
        d.push_back(i);
        if(i-k==d.front())
        d.pop_front();
        if(i>k && a[d.front()]>sol)
        { 
            sol=a[d.front()];
            sfarsit=i;
        }
    }
    cout<<sfarsit-k+1<<" "<<sfarsit<<" "<<sol;
    return 0;}