#include <bits/stdc++.h>
using namespace std;

int main() {
    int N, Q;
    cin >> N >> Q;

    vector<int> X(N);
    for (int i = 0; i < N; i++) {
        cin >> X[i];
    }

    vector<int> unique_X = X;
    sort(unique_X.begin(), unique_X.end());
    unique_X.erase(unique(unique_X.begin(), unique_X.end()), unique_X.end());

    if (N + unique_X.size() > Q) {
        cout << "No" << endl;
        return 0;
    }

    vector<tuple<int, int, int>> queries;
    for (int x: unique_X) {
        tuple<int, int, int> query = {1, x, x};
        queries.push_back(query);
    }

    for (int x: X) {
        tuple<int, int, int> query = {2, x, 0};
        queries.push_back(query);
    }

    while (queries.size() < Q) {
        tuple<int, int, int> query = {1, 1, 1};
        queries.push_back(query);
    }

    cout << "Yes" << endl;
    for (auto query: queries) {
        if (get<0>(query) == 1) {
            cout << get<0>(query) << " " << get<1>(query) << " " << get<2>(query) << endl;
        } else {
            cout << get<0>(query) << " " << get<1>(query) << endl;
        }
    }

    return 0;
}