#include <bits/stdc++.h>

using namespace std;

ifstream fin("secventa.in");
ofstream fout("secventa.out");

int n, k;
int v[500500];
int dq[500500];
int lg[500500];
int dreapta[500500];
int stanga[500500];
int st = 0, dr = -1;

int main()
{
    fin >> n >> k;
    for(int i = 1; i <= n; i ++)
    {
        fin >> v[i];
    }
    v[n + 1] = -33333;
    for(int i = 1; i <= n + 1; i ++)
    {
        while(st <= dr && v[dq[dr]] > v[i])
        {
            dreapta[dq[dr]] = i;
            dr--;
        }
        dq[++dr] = i;
        stanga[dq[dr]] = i;
    }
    int minim = 0;
    int posdr = 0, posst = 0;
    for(int i = 1; i <= n; i ++)
    {
        if(stanga[i] && dreapta[i] && dreapta[i] - stanga[i] >= k)
        {
            if(v[i] > minim)
            {
                minim = v[i];
                posst = stanga[i];
                posdr = dreapta[i] - 1;
            }
        }
    }
    fout << posst << ' ' << posdr << ' ' << minim << '\n';
    return 0;
}