#include <bits/stdc++.h>

using namespace std;

int n, k;
int a[500005];

deque <int> q;

void Citire()
{
    char s[500005];
    int i, nr, j, semn;
    ifstream fin("secventa.in");
    fin >> n >> k;
    nr = j = 0;
    semn = 1;
    fin.get();
    while(fin.get(s, 500000))
    {
        for(i = 0; s[i]; i++)
            if(s[i] == '-') semn = -1;
            else if(s[i] == ' ')
            {
                a[++j] = nr * semn;
                nr = 0;
                semn = 1;
            }
            else nr = nr * 10 +s[i] - '0';
    }
    if(j < n) a[++j] = nr * semn;
    fin.close();
}

void Rezolva()
{
    int nmax, x, i, st, dr;
    for(i = 1; i <= k; i++)
    {
        x = a[i];
        while(!q.empty() && a[q.back()] >= x)
            q.pop_back();
        q.push_back(i);
    }
    nmax = a[q.front()];
    st = 1;
    dr = k;
    for(i = k + 1; i <= n; i++)
    {
        x = a[i];
        while(!q.empty() && a[q.back()] >= x)
            q.pop_back();
        q.push_back(i);
        if(i - q.front() >= k) q.pop_front();
        if(nmax < a[q.front()])
        {
            nmax = a[q.front()];
            st = i - k + 1;
            dr = i;
        }
    }
    ofstream fout("secventa.out");
    fout<<st<<" "<<dr<<" "<<nmax<<"\n";
    fout.close();
}

int main()
{
    Citire();
    Rezolva();
    return 0;
}