#include <iostream>
#include <cstdio>
#include <deque>
#include <climits>

using namespace std;

int n, k;
int numere[5000005];
long long rezFinal = INT_MAX;
deque<int> Q;
int x, y;

void citire()
{
    scanf("%d %d", &n, &k);

    for(int i = 0; i < n; i++)
    {
        scanf("%d", &numere[i]);
    }
}

void solve()
{
    long long sum = 0;

    Q.push_back(0);

    for(int i = 1; i < n; i++)
    {
        while(!Q.empty() && numere[Q.back()] > numere[i])
        {
            Q.pop_back();
        }

        Q.push_back(i);

        if(i - Q.front() >= k)
        {
            Q.pop_front();
        }

        sum = numere[Q.front()] * 1LL;

        if(rezFinal < sum && i >= k - 1)
        {
            rezFinal = sum;
            y = i;
        }
    }
}

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

    citire();
    solve();


    printf("%d %d %lld", y - k + 1 + 1, y + 1, rezFinal);

    return 0;
}