#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<vector<int>> queries;
    for (int x: unique_X) {
        queries.push_back({1, x, x});
    }

    for (int x: X) {
        queries.push_back({2, x});
    }

    while (queries.size() < Q) {
        queries.push_back({1, 1, 1});
    }

    cout << "Yes" << endl;
    for (auto query: queries) {
        for (int value: query) {
            cout << value << " ";
        }
        cout << endl;
    }

    return 0;
}