#include<cstdio>
using namespace std;

int n, k, i, maxx, ind;
int v[5000010], Deque[5000010];
int prim, ult;
long long sum;

int main()
    {
        freopen("secventa.in","r",stdin);
        freopen("secventa.out","w",stdout);
        scanf("%d%d", &n, &k);

        for (i = 1; i <= n; i++)
            scanf("%d", &v[i]);

        prim=1;
        ult=0;

        for(i = 1; i <= n; i++)
        {
            while (prim <= ult && v[i] <= v[ Deque[ult] ])
                ult--;
            Deque[++ult]=i;

            if (Deque[prim] == i - k)
                prim++;
            if (i >= k)
                if (v[Deque[prim]] > maxx)
                {
                    ind=i;
                    maxx=v[Deque[prim]];
                }
        }

        printf("%d %d %d\n", ind - k + 1, ind, maxx);
    }