#include <iostream>
 
using namespace std;
 
struct edge
{
	int v;
	edge *next;
	edge(int v,edge *next):v(v),next(next) {}
} *e[222];
int match[222];
bool u[222];
 
bool findAugmentPath(int v)
{
	for(edge *t=e[v];t;t=t->next)
		if(!u[t->v])
		{
			u[t->v]=true;
			if(!match[t->v]||findAugmentPath(match[t->v]))
			{
				match[t->v]=v;
				return true;
			}
		}
	return false;
}
 
int main()
{
	int n,k,t,p;
	scanf("%d%d",&n,&k);
	if(k*2>n)
	{
		puts("NO");
		return 0;
	}
	for(int i=1;i<=n;++i)
		for(scanf("%d",&t);t;--t)
		{
			scanf("%d",&p);
			e[i]=new edge(p,e[i]);
			e[i]=new edge(k+p,e[i]);
		}
	int total=0;
	for(int i=1;i<=n;++i)
	{
		memset(u,false,sizeof(u));
		if(findAugmentPath(i)) ++total;
	}
	if(total==(k<<1))
	{
		puts("YES");
		for(int i=1;i<=k;++i) printf("2 %d %d\n",match[i],match[k+i]);
	}
	else puts("NO");
	return 0;
}

#include <cmath>
#include <ctime>
#include <iostream>
#include <sstream>
#include <map>
#include <algorithm>
#include <string>
#include <vector>
 
using namespace std;
 
class LampsGrid
{
public:
	int mostLit(vector <string> initial, int K)
	{
		int ans=0;
		for(int i=0;i<initial.size();++i)
		{
			int num=0;
			for(int j=0;j<initial[i].size();++j) num+=initial[i][j]=='0';
			if(num>K||(K-num)%2) continue;
			num=0;
			for(int j=0;j<initial.size();++j) num+=initial[i]==initial[j];
			ans=max(ans,num);
		}
		return ans;
	}
};