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

using namespace std;

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

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

int N, K;
int num, ans = -INF, l, r;
int v[NMAX];

pair <int, int> p;
deque <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 >> v[i];

        while (!dq.empty() && v[dq.back()] >= v[i]) dq.pop_back();
        dq.push_back(i);
    }
    ans = v[dq.front()];
    l = 1, r = K;
    for (int i = K + 1 ; i <= N ; ++ i)
    {
        f >> v[i];
        while (!dq.empty() && v[dq.back()] >= v[i]) dq.pop_back();
        dq.push_back(i);

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