#include<iostream>
#include<fstream>
#include<deque>
#include<vector>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
struct coord
{
    int x,y,min;
};
deque<int> q;
int n,k;
int v[50000001];
vector<coord> pozitii;
void Citire()
{
    f>>n>>k;
}
void Solve()
{
    for(int i=1;i<=n;i++)
        f>>v[i];
    int current_min;
    coord nr;
    for(int i=1;i<=n;i++)
    {
        while(!q.empty() && v[q.back()]>=v[i])
             q.pop_back();
        q.push_back(i);
        if(q.back()-q.front()>=k)
        {
            nr.x=i;
            q.pop_front();
        }
        if(i>=k)
        {
            if(!q.empty())
            {
                cout<<q.front()<<" ";   
                current_min=v[q.front()];
                nr.y=i;
                nr.min=v[q.front()];
                pozitii.push_back(nr);
            }
        }   
    }
    cout<<"\n";
    for(int i=0;i<pozitii.size();i++)
    {
        cout<<pozitii[i].x<<" "<<pozitii[i].y<<" "<<pozitii[i].min<<"\n";
    }
}
int main()
{
    Citire();
    Solve();
}