#include <bits/stdc++.h>

using namespace std;

#define N 500000
#define X 30000

int v[N+1];

deque <int> q;

int main()
{
    ifstream cin ("secventa.in");
    ofstream cout ("secventa.out");

    int n,k,i,x,a,b;

    cin >> n >> k;

    for (i=1; i<=n; i++)
        cin >> v[i];

    x=-X;
    for (i=1; i<=n; i++){
        while (!q.empty() && v[i]<=v[q.back()])
            q.pop_back();

        q.push_back(i);
        if (i-q.front()+1>k)
            q.pop_front();

        if (i>=k && x<v[q.front()]){
            x=v[q.front()];
            a=i-k+1;
            b=i;
        }
    }

    cout << a << ' ' << b << ' ' << x << '\n';

    return 0;
}