#include <fstream>
#include <queue>
#define INF 30005

using namespace std;

/****************************/
/// INPUT / OUTPUT

ifstream f("secventa.in");
ofstream g("secventa.out");
/****************************/
/// GLOBAL DECLARATIONS

int N, K;
int num, ans = -INF, l, r;

pair <int, int> p;
deque < pair <int, int> > dq;
/****************************/
/// FUNCTIONS

void ReadInput();
void Solution();
void Output();
/****************************/
////------------------------------------
inline void ReadInput()
{
    f >> N >> K;
}
////------------------------------------
inline void Solution()
{
    for (int i = 1 ; i <= K ; ++ i)
    {
        f >> num;

        while (!dq.empty() && dq.back().first >= num) dq.pop_back();
        p.first = num, p.second = i;
        dq.push_back(p);
    }
    ans = dq.front().first;
    l = 1, r = K;
    // g << ans << "\n";
    for (int i = K + 1 ; i <= N ; ++ i)
    {
        f >> num;
        while (!dq.empty() && dq.back().first >= num) dq.pop_back();
        p.first = num, p.second = i;
        dq.push_back(p);

        if (dq.front().second <= i - K) dq.pop_front();
        if (ans < dq.front().first)
        {
            ans = dq.front().first;
            l = i - K + 1, r = i;
        }
    }
}
////------------------------------------
inline void Output()
{
    g << l << " " << r << " " << ans;
}
////------------------------------------
int main()
{
    ReadInput();
    Solution();
    Output();
    return 0;
}