#include <fstream>
#include <deque>


using namespace std;

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


   int main() {

    deque<int> q;
    int v[500001];

    int n, k, i, j, x = 0, y = 0, maxi = -32001;

    cin >> n >> k;

    for (i = 1; i <= n; ++i) {

            cin >> v[i];

        while (!q.empty() && v[q.back()] > v[i])
            q.pop_back();

        if (!q.empty() && q.front() == i - k)
            q.pop_front();

        q.push_back(i);



        if (i >= k && v[q.front()] > maxi) {
                    maxi = v[q.front()];
                    y = i;
                }


    }

    cout << y - k + 1 << ' ' << y << ' ' << maxi;
    return 0;
}