#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}


string ans,s = "";
void tec(string s,ll i) {
    if (i == 1) {
        ans = s;
        return;
    }
    
    i--;
    if (i % 2 == 0) tec(s+'A',i/2); 
    if (i % 3 == 0)  tec(s + 'B', i/3);  
}



int main()
{

    int Q;
    Q = 1;
    //cin >> Q;   

    while (Q--) {
        ll n, m;
        cin >> n >> m;
        vector<int>p(n);
        set<int>s;
        for (int i = 0; i < n; i++) {
            cin >> p[i]; s.insert(p[i]);
        }
        if (m < n+s.size()) {
            cout << "No"; return 0;
        }
        cout << "Yes" << endl;
        map<int, int>mp;
        int x = 0;
        for (int i = 0; i < m; i++) {
            if (x < n) {
                if (!mp[p[x]]) {
                    cout << "1 " << p[x]<<" " << p[x] << endl;
                    mp[p[x]]++;

                }
                else {
                    cout << "2 " << p[x] << endl;
                    x++;
                }
            }
            else cout<< "1 " << 1<<" " << 1 << endl;
        }
        

    }
        return 0;
}