#include <cstdio>
#include <fstream>
#include <deque>

using namespace std;

deque <pair <int, int > > deck;

int main()
{
    FILE *f = fopen("secventa.in", "r");
    FILE *g = fopen("secventa.out", "w");
    int n, k, x, rez, maxi = -30005;
    fscanf(f, "%d%d", &n, &k);
    for(int i = 1; i <= n; i++)
    {
        fscanf(f, "%d", &x);
        if(i-deck.front().second+1 > k)
            deck.pop_front();
        while(!deck.empty() && deck.back().first > x)
            deck.pop_back();
        deck.push_back({x, i});
        if(i >= k && maxi < deck.front().first)
        {
            maxi = deck.front().first;
            rez = deck.back().second;
        }
    }
    fprintf(g, "%d %d %d", rez-k+1, rez, maxi);

    return 0;
}