#include <bits/stdc++.h>

using namespace std;

ifstream fin ("secventa.in");
ofstream fout ("secventa.out");


multiset <int> S;
int n , k , a[500005];

int main()
{
    int i, p1 , p2 , b, bmax = 0;
    fin >> n >> k;
    for (i = 1; i <= n; i++)
        fin >> a[i];
    for (i = 1; i <= k; i++)
        S.insert(a[i] + 30000) ;
    p1 = 1;
    p2 = k;
    b = *S.begin();
    bmax = b;
    for (i = k + 1; i <= n; i++)
    {
        b = *S.begin();
        S.erase(b);
        S.insert(a[i] + 30000);
        b = *S.begin();
        if (bmax < b)
        {
            p1 = i - k + 1;
            p2 = i;
            bmax = b;
        }
    }
    fout << p1 << " " << p2 << " " << bmax - 30000 << "\n";
    return 0;
}