#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define pb push_back
#define sc second
#define fr first
#define endl '\n'

void solve()
{
    int n, k;
    cin >> n >> k;
    int a[n+1];
    for(int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    deque<int> now;
    int l = 0, r = k-1, mx = 0;
    for(int i = 0; i < k; i++)
    {
        while(!now.empty() && a[now.back()] >= a[i])
        {
            now.pop_back();
        }
        now.push_back(i);
    }
    mx = a[now.front()];
    for(int i = k; i < n; i++)
    {
        while(!now.empty() && now.front() <= i-k)
        {
            now.pop_front();
        }
        while(!now.empty() && a[now.back()] >= a[i])
        {
            now.pop_back();
        }
        now.push_back(i);
        if(a[now.front()] > mx)
        {
            mx = a[now.front()];
            l = i-k+1;
            r = i;
        }
    }
    cout << l+1 << " " << r+1 << " " << mx << endl;
}

int32_t main(){
    startt;
    freopen("secventa.in", "r", stdin);
    freopen("secventa.out", "w", stdout);
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
}