#include<stdio.h>
#include<deque>
#define maxn 500005
#define inf 0x3f3f3f3f
using namespace std;

int n,m,L,R,maxc=-inf;
int a[maxn];
deque <int> q;

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

void solve()
{
    for(int i=1;i<=n;i++)
    {
        while(!q.empty() && a[q.back()]>=a[i]) q.pop_back();
        q.push_back(i);

        if(q.front()==i-m) q.pop_front();
        if(maxc<a[q.front()] && i>=m) maxc=a[q.front()],L=i-m+1,R=i;
    }
    printf("%d %d %d",L,R,maxc);
}

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

    read();
    solve();

    fclose(stdin);
    fclose(stdout);
    return 0;
}