#include <atcoder/all>
#include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
using namespace atcoder;
using namespace std;

typedef long long ll;

void solve() {
    int n, q;
    cin >> n >> q;
    vector<int> t, p, x;
    map<int, int> ma;
    int id = 100;
    rep(i, 0, n) {
        int v;
        cin >> v;
        if (v == 0) {
            t.push_back(2);
            p.push_back(1e9);
            x.push_back(0);
        } else if (ma.count(v)) {
            t.push_back(2);
            p.push_back(ma[v]);
            x.push_back(0);
        } else {
            t.push_back(1);
            p.push_back(id);
            x.push_back(v);
            ma[v] = id++;
            t.push_back(2);
            p.push_back(ma[v]);
            x.push_back(0);
        }
    }
    if (t.size() > q) {
        cout << "No\n";
        return;
    }
    while (t.size() < q) {
        t.push_back(1);
        p.push_back(1);
        x.push_back(1);
    }
    cout << "Yes\n";
    rep(i, 0, q) {
        if (t[i] == 1) {
            cout << t[i] << " " << p[i] << " " << x[i] << "\n";
        } else {
            cout << t[i] << " " << p[i] << "\n";
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    while (t--) {
        solve();
    }
}