#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define mod 998244353
int main(){
    cin.tie(0)->sync_with_stdio(0);
    cout.tie(0);
    int N,Q;
    int X[200009];
    cin>>N>>Q;
    for(int i=1;i<=N;i++) cin>>X[i];
    vector<int>siz;
    for(int i=1;i<=N;i++) siz.push_back(X[i]);
    sort(siz.begin(),siz.end());
    siz.erase(unique(siz.begin(),siz.end()),siz.end());
    if(siz.size()*2>Q){
        cout<<"No"<<endl;
        return 0;
    }
    cout<<"Yes"<<endl;
    map<int,int>dat;
    for(int i=1;i<=siz.size();i++){
        cout<<"1 "<<i<<" "<<siz[i-1]<<endl;
        dat[siz[i-1]]=i;
    }
    for(int i=1;i<=N;i++){
        cout<<"2 "<<dat[X[i]]<<endl;
    }
    for(int i=siz.size()+N;i<Q;i++){
        cout<<"1 1 1"<<endl;
    }
}