#include <bits/stdc++.h>
using namespace std;
int n,k,i,ma,df,v[500020],mi,x,y,poz,pos;
long long s;
deque<int>dm;
queue<pair <int,int> >q;
pair <int,int>a;
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);
    //ofstream g ("secventa.out");
    freopen("secventa.out","w",stdout);
    scanf("%d%d",&n,&k);
    ma=-30010;
    for(i=1; i<=n; ++i)
        scanf("%d",&v[i]);
    for(i=1; i<=n; ++i)
    {
        while(!dm.empty()&&v[i]<v[dm.back()])dm.pop_back();
        dm.push_back(i);
        if(i-dm.front()==k)dm.pop_front();
        if(i>=k&& v[dm.front ()] > ma)ma = v[dm.front ()], poz = i;
    }
    pos = poz - k;
    while(pos)
    {
        if (v[pos] < ma) break;
        --pos;
    }
    //g<<++pos<<" "<<poz<<" "<<ma;
    printf("%d %d %d",++pos,poz,ma);
    return 0;
}