#include <bits/stdc++.h>

using namespace std;

void fast_io() {
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
}

int main() {
	fast_io();
	int n, q;
	cin >> n >> q;
	vector<int> x(n);
	for (int i = 0; i < n; i++) {
		cin >> x[i];
	}
	vector<int> xs = x;
	sort(xs.begin(), xs.end());
	xs.erase(unique(xs.begin(), xs.end()), xs.end());
	if (n + xs.size() > q) {
		cout << "No" << endl;
		return 0;
	}
	cout << "Yes" << endl;
	int cur = 1;
	int cnt = 0;
	map<int, int> idx;
	for (int i = 0; i < n; i++) {
		if (idx.find(x[i]) == idx.end()) {
			cout << "1 " << cur << " " << x[i] << "\n";
			idx[x[i]] = cur++;
			cnt++;
		}
		cout << "2 " << idx[x[i]] << "\n";
		cnt++;
	}
	for (int i = 0; i < q - cnt; i++) {
		cout << "1 " << (int)1e9 << " " << 1 << "\n";
	}
}