/* -*- coding: utf-8 -*-
 *
 * 3126.cc:  No.3126 Dual Query Problem - yukicoder
 */

#include<cstdio>
#include<unordered_map>
#include<algorithm>
#include<tuple>

using namespace std;

/* constant */

const int MAX_N = 200000;
const int MAX_QN = 200000;

/* typedef */

using umii = unordered_map<int,int>;
using tp3 = tuple<int,int,int>;

/* global variables */

int xs[MAX_N];
tp3 ops[MAX_QN + 4];

/* subroutines */

/* main */

int main() {
  int n, qn;
  scanf("%d%d", &n, &qn);
  for (int i = 0; i < n; i++) scanf("%d", xs + i);

  int m = 0, p = 0;
  umii xps;
  for (int i = 0; i < n; i++) {
    if (! xps.count(xs[i])) {
      xps[xs[i]] = ++p;
      ops[m++] = {1, p, xs[i]};
    }
    ops[m++] = {2, xps[xs[i]], -1};
    if (m > qn) { puts("No"); return 0; }
  }

  while (m < qn) ops[m++] = {1, 1, 1};

  puts("Yes");
  for (int i = 0; i < qn; i++) {
    auto [op, p, x] = ops[i];
    if (op == 1) printf("1 %d %d\n", p, x);
    else printf("2 %d\n", p);
  }
  
  return 0;
}