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

int n,k;
int maxim=INT_MIN;
int a[5000001],inceput;

class Deque
{
private:
    int inc,sf;
    long long int arr[5000001];
public:
    Deque()
    {
        inc=sf=0;
    }
    void adauga_sfarsit(int x)
    {
        arr[sf]=x;
        sf++;
    }
    int prim()
    {
        return arr[inc];
    }
    int ultim()
    {
        return arr[sf-1];
    }
    void scoate_prim()
    {
        inc++;
    }
    void scoate_ultim()
    {
        sf--;
    }
    bool vida()
    {
        return sf-inc==0;
    }
}d;

void solve()
{
    scanf("%d %d",&n,&k);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);

    for(int i=1;i<k;i++)
    {
        while(!d.vida() && a[d.ultim()]>=a[i])
            d.scoate_ultim();
        d.adauga_sfarsit(i);
    }

    for(int i=k;i<=n;i++)
    {
        if(!d.vida() && d.prim()<=i-k)
                d.scoate_prim();
        while(!d.vida() && a[d.ultim()]>=a[i])
                d.scoate_ultim();
            d.adauga_sfarsit(i);
        if(a[d.prim()]>maxim && i>=k-1)
        {
            inceput=d.prim();
            maxim=a[d.prim()];
        }
    }

    printf("%d %d %d",inceput,inceput+k-1,maxim);
}

int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    solve();
    return 0;
}