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

int n,k;
long long int maxim;
int a[5000001];

class Deque
{
private:
    int inc,sf;
    long long int arr[50000001];
public:
    Deque()
    {
        inc=sf=0;
    }
    void adauga_inceput(int x)
    {
        for(int i=sf;i>=inc;i--)
            arr[i+1]=arr[i];
        sf++;
        arr[inc]=x;
    }
    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<=n;i++)
    {
        while(!d.vida() && a[d.ultim()]>=a[i])
                d.scoate_ultim();
        d.adauga_sfarsit(i);
        if(d.prim()+k<=i)
            d.scoate_prim();
        if(maxim<a[d.prim()] && i>=k-1)
            maxim=d.prim();
    }
    printf("%d %d %lld",d.prim(),d.ultim(),maxim);
}

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