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

void solve(){
	ll N,Q;
	cin>>N>>Q;
	set<ll> S;
	vector<ll> X(N);
	for(int i=0;i<N;i++){
		cin>>X[i];
		S.insert(X[i]);
	}
	if(Q<N+int(S.size())){
		cout<<"No"<<endl;
		return;
	}
	else{
		for(auto s:S)cout<<1<<" "<<s<<" "<<s<<endl;
		for(int i=0;i<N;i++)cout<<2<<" "<<X[i]<<endl;
		for(int i=0;i<Q-N-int(S.size());i++)cout<<1<<" "<<1<<" "<<1<<endl;
	}
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
	
	ll T=1;
	// cin>>T;
	while(T--)
	solve();

}