#include <fstream> //pb secventa
#include <deque>
#include <stack>
using namespace std;

int a[500005];
deque<int > dq;

int main() {
    ifstream fin("secventa.in");
    ofstream fout("secventa.out");


    int n, k;
    fin >> n >> k;

    for (int i = 1; i <= n; i++) {
        fin >> a[i];
    }

    int baza = -30001;
    int st = 1, dr = k;

 for (int i = 1; i <= k; i++) {
     int x = a[i];
     while (!dq.empty() && x < dq.back()) {

         dq.push_back(a[i]);
     }
 }

    for (int i = k + 1; i <= n; i++)

    fout << st << " " << dr << " " << baza;

    return 0;
}