#include<cstdio>
#include<algorithm>
#include<deque>
#define Nmax 500000
#define Inf 1000000000
using namespace std;
int n,k,i,j,p,q,nr;
deque< int >d;
int v[Nmax];
class InputReader
{
public:
    InputReader() {}
    InputReader(const char *file_name)
    {
        input_file = fopen(file_name, "r");
        cursor = 0;
        fread(buffer, SIZE, 1, input_file);
    }
    inline InputReader &operator >>(int &n)
    {
        while(buffer[cursor] < '0' || buffer[cursor] > '9')
        {
            advance();
        }
        n = 0;
        while('0' <= buffer[cursor] && buffer[cursor] <= '9')
        {
            n = n * 10 + buffer[cursor] - '0';
            advance();
        }
        return *this;
    }
private:
    FILE *input_file;
    static const int SIZE = 1 << 17;
    int cursor;
    char buffer[SIZE];
    inline void advance()
    {
        ++ cursor;
        if(cursor == SIZE)
        {
            cursor = 0;
            fread(buffer, SIZE, 1, input_file);
        }
    }
};
int main()
{
    //freopen("secventa.in","r",stdin);
    InputReader cin("secventa.in");
    freopen("secventa.out","w",stdout);
    cin >> n >> k; nr=-Inf;
    for (i=1;i<=n;i++)
    {
        cin >> v[i];
        while ((!d.empty())&&(v[d.back()]>=v[i])) d.pop_back();
        d.push_back(i);
        if (i>=k && v[d.front()]>nr)
        nr=v[d.front()],p=i-k+1,q=i;
        if (i-k+1==d.front()) d.pop_front();
    }
    printf("%d %d %d",p,q,nr);
    return 0;
}