#include <cstdio>
#include <queue>
using namespace std;
const int Nmax = 5000001;
int n, k, x, i, j, sign, maxmin=-30001, u, Deque[Nmax];
char s[10000005];
deque < pair <int,int> > D;
int main()
{   freopen("secventa.in", "r", stdin); freopen("secventa.out", "w", stdout);
    scanf("%d %d ", &n, &k);
    fgets(s,10000005,stdin); // citire parsata a elementelor sirului A
    for(i=1; i<=n; ++i)
    {   sign=1; x=0;
        if(s[j]==' ') j++;
        if(s[j]=='-') {sign=-1; j++;}
        while('0'<=s[j] && s[j]<='9') {x=x*10+s[j]-'0'; j++;}
        x *= sign;
        if(D.empty()) D.push_back(make_pair(x,i));
        else
        {   while(!D.empty() && D.back().first > x) D.pop_back();
            D.push_back(make_pair(x,i));
            while(D.front().second<=i-k) D.pop_front();
            if(i>=k) if(D.front().first > maxmin) {maxmin=D.front().first; u=i;}
        }
    }
    printf("%d %d %d\n", u-k+1, u, maxmin);
    return 0;
}