#include <cstdio>
#include <algorithm>
#include <deque>
#define Dim 500002
#define INF 1000000002

using namespace std;
int n, k, v[Dim], Sol = -INF, F, L;
deque <int> d;
int main()
{
    freopen("secventa.in", "r", stdin);
    freopen("secventa.out", "w", stdout);
    scanf("%d %d", &n, &k);
    for(int i = 1; i <= n; ++ i)
    {
        scanf("%d", &v[i]);
        while(!d.empty() && v[i] < v[d.back()])
            d.pop_back();
        d.push_back(i);
        if(i >= k && Sol < v[d.front()])
        {
            Sol = v[d.front()];
            F = i - k + 1;
            L = i;
        }
        if(!d.empty() && d.front() == i - k + 1)
            d.pop_front();
    }
    printf("%d %d %d\n", F, L, Sol);
    return 0;
}