#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;

#define rep(i, n) for (int i = 0; i < (n); ++i)

int main() {

  int n,q; cin >> n >> q;
  vector<int> a(n);
  rep(i,n) cin >> a[i];

  if (n*2 > q){
    cout << "No" << endl;
    return 0;
  }

  vector<int> ans;

  rep(qi,q){
    if (qi < q-n){
      if (qi >= (int)a.size()){
        cout << 1 << " " << qi+1 << " " << 1 << "\n";
        ans.push_back(1);
      } else{
        cout << 1 << " " << qi+1 << " " << a[qi] << "\n";
        ans.push_back(a[qi]);
      }
    } else{
      cout << 2 << " " << qi-n << "\n";
    }
  }

  return 0;
}