#include <bits/stdc++.h>
#define nmax 500005
using namespace std;

int n, k;
deque <int> q;
int st, dr, mx;
int a[nmax];
char s[nmax * 10];

void Read()
{
    ifstream fin("secventa.in");
    fin >> n >> k;
    fin.get();
    fin.getline(s, nmax * 10);
    int semn;
    int c, lg;
    int m = 0;

    lg = strlen(s);

    for(int i = 0; i < lg;)
    {
        if(s[i] == '-')
        {
            semn = -1;
            i++;
        }
        else semn = 1;

        int nr = 0;
        while('0' <= s[i] && s[i] <= '9')
        {
            c = s[i] - '0';
            nr = nr * 10 + c;
            i++;
        }
        i++;
        a[++m] = nr * semn;
    }
}

void Solve()
{
    ofstream fout("secventa.out");

    int i, x;

    for(i = 1; i <= k; i++)
    {
        while(!q.empty() && x < a[q.back()])
            q.pop_back();
        q.push_back(i);
    }
    mx = a[q.front()];
    dr = q.back();
    st = dr - k + 1;

    for(i = k + 1; i <= n; i++)
    {
        x = a[i];
        while(!q.empty() && x < a[q.back()])
            q.pop_back();
        q.push_back(i);

        if(!q.empty() && q.front() < i - k + 1)
            q.pop_front();

        if(mx < a[q.front()])
        {
            dr = q.back();
            st = dr - k + 1;
            mx = a[q.front()];
        }
    }
    fout << st << " " << dr << " " << mx << "\n";
}

int main()
{
    Read();
    Solve();
    return 0;
}