#include <cstdio>
#include <deque>

using namespace std;

const int nmx = 500002;
const int inf = 0x3f3f3f3f;

int n,k;
int maxim = -inf, pos;
deque <pair<int,int> > dq;

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

    scanf("%d %d", &n, &k);
    for(int i = 1; i <= n; ++i)
    {
        int nr;
        scanf("%d", &nr);

        while(not dq.empty() && dq.front().first > nr)
            dq.pop_front();

        dq.push_front(make_pair(nr,i));

        if(not dq.empty() && dq.back().second <= i - k)
            dq.pop_back();

        if(dq.back().first > maxim)
        {
            maxim = dq.back().first;
            pos = i;
        }
    }

    printf("%d %d %d\n", pos - k + 1, pos, maxim);

    return 0;
}