#include <bits/stdc++.h>

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

int main()
{
    long long n, k, i, a[50001], m[50001], j;
    pair<int,int>p[50001];
    fin>>n>>k;
    for(i=1;i<=n;i++)
        fin>>a[i];
    for(i=1;i<=n-k+1;i++){
            m[i]=a[i];
        for(j=i;j<=k+i-1;j++)
        if(a[j]<m[i])
        {m[i]=a[j];}

        p[i].first=m[i];
        p[i].second=i;}

        sort(p+1, p+n-k+2);



        fout<<p[n-k+1].second<<" "<<p[n-k+1].second+k-1<<" "<<p[n-k+1].first;



    return 0;
}