#include <iostream>
#include <fstream>
#include <cstdio>
using namespace std;

int N,K,a[500010],q[500010];

int main(){
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    scanf("%d %d\n",&N,&K);

    int i,l=1,r=0,MAX=-(1<<30),ind;
    for (i=1; i<=N; i++) scanf("%d",&a[i]);

    for (i=1; i<=N; i++){
        q[++r]=i;

        while (r && q[l]<i-K+1) l++;
        while (r>l && a[q[r]]<=a[q[r-1]]) q[r-1]=q[r],r--;

        if (i>=K)
            if (MAX<a[q[l]]){
                ind=i;
                MAX=a[q[l]];
            }
    }

    printf("%d %d %d\n",ind-K+1,ind,MAX);
    return 0;
}