#include <iostream>
#include <cstdio>
#include <deque>
#define INF 0x3f3f3f

using namespace std;

int k, n, a[500005], maxim=-INF, poz;
deque <int> q;

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

int minimSecventa(int start, int finish)
{
    int x=INF;
    for(int i=start; i<=finish; ++i)
        x=min(a[i], x);
    return x;
}

void stergereElemente(int x)
{
    while(!q.empty() && a[x]<a[q.back()])
        q.pop_back();
}

void rezolvare()
{
    for(int i=1; i<=k-1; ++i)
    {
        stergereElemente(i);
        q.push_back(i);
    }
    for(int i=k; i<=n; ++i)
    {
        stergereElemente(i);
        q.push_back(i);
        if(q.back()-q.front()>k-1)
            {
                q.pop_front();
            }
        if(q.front()>maxim)
        {
            maxim=a[q.front()];
            poz=q.back();
        }
    }
}

int main()
{
    freopen("secventa.in", "r", stdin);
    freopen("secventa.out", "w", stdout);
    citire();
    rezolvare();
    printf("%d %d %d", poz-k+1, poz, maxim);
    return 0;
}