#include <bits/stdc++.h>
using namespace std;
int n,k,i,ma,df,v[500020],mi,x,y,poz,pos;
long long s;
deque<int>dm;
queue<pair <int,int> >q;
char ss[5000010];
pair <int,int>a;
int main()
{
    freopen("secventa.in","r",stdin);
    ofstream g ("secventa.out");
    scanf("%d%d\n",&n,&k);
    ma=-30010;
    ///facem parsare a citirii ca niste oameni inteligenti
    gets (ss);
    int nn = strlen (ss);

    int xx=1, x=0, p=0;
    for (i=0; i<nn; ++i)
        if (ss[i] == ' ')
        {
            v[++p]=x;
            x=0;
            xx=1;
            continue;
        }
        else if(ss[i]=='-')xx = -1;
        else x=x*10+xx*(ss[i] - 48);

    v[n] = x;
    ///multumiri speciale pentru parsare Theo :D
    for(i=1; i<=n; ++i)
    {
        while(!dm.empty()&&v[i]<v[dm.back()])dm.pop_back();
        dm.push_back(i);
        if(i-dm.front()==k)dm.pop_front();
        if(i>=k&& v[dm.front ()] > ma)ma = v[dm.front ()], poz = i;
    }
    pos = poz - k;
    while(pos)
    {
        if (v[pos] < ma) break;
        --pos;
    }
    g<<++pos<<" "<<poz<<" "<<ma;
    return 0;
}