#include <iostream>
#include <deque>
#include <stdio.h>

using namespace std;

int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    int n,k,i,j;
    int a[500010];
    int min,max,mind;
    scanf("%d%d",&n,&k);
    for(i=1;i<=n;++i)
        scanf("%d",&a[i]);
    deque<int> deq;
    deq.push_back(a[1]);
    min = a[1];
    for(i=2;i<=k;++i)
    {
        deq.push_back(a[i]);
        if(a[i] < min)
            min = a[i];
    }
    max = min;
    mind = 1;
    for(i=k+1;i<=n;++i)
    {
        if(deq.front() == min)
        {
            deq.pop_front();
            deq.push_back(a[i]);
            min = deq.front();
            for(j=1;j<k;++j)
                if(deq[j] < min)
                    min = deq[j];
            if(min > max)
            {
                max = min;
                mind = i+1-k;
            }
        }
        else
        {
            deq.pop_front();
            deq.push_back(a[i]);
        }
    }
    printf("%d %d %d \n",mind,mind+k-1,max);
    return 0;
}