1047

#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
int n,k;
const int maxn = 2600;
vector<int> course[maxn];
int change(char s[])
{
	int sum = 0;
	for(int i = 0; i < 3; i++)
	   sum = sum * 26 + s[i]-'A';
	sum = sum * 10 + s[3]-'0';
	return sum;
}
void print(int s)
{
	printf("%c%c%c%d\n",s/26/26/10 + 'A',s/260%26+'A',s/10%26+'A',s%10);
	
} 
int main()
{
	char s[5];
	int u,c;
	scanf("%d %d",&n,&k);
	for(int i = 0; i < n; i++)
	{
		scanf("%s",s);
		scanf("%d",&u);
		int t = change(s);
		for(int j = 0; j < u; j++)
		{
			scanf("%d",&c);
			course[c].push_back(t);
		}
	}
	for(int i = 1 ;i <= k; i++)
	sort(course[i].begin(),course[i].end());
	for(int i = 1; i <= k; i++)
	{
		printf("%d %d\n",i,course[i].size());
		for(int j = 0; j < course[i].size(); j++)
		{
			print(course[i][j]);
		}
		
	}
	
	return 0;
}