#include <bits/stdc++.h>

using namespace std;
int a[100];
deque <int> q;
int main()
{
    int i , n , k, x, m, p;
    cin >> n >> k;
    for (i = 1;i <= n;i++)
        cin >> a[i];
    for (i = 1;i <= k;i++)
    {
        x = a[i];
        while (!q.empty() && x <= a[q.back()])
            q.pop_back ();
        q.push_back(i);
    }
    m = a[q.front()];
    p = i;
    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 (i - k == q.front()) q.pop_front();
            if (m < q.front())
            {
                p = i;
                m = a[q.front()];
            }
    }
    cout << p - k + 1 << " " << p << " " << m;
    return 0;
}