1039.cpp

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int gedit(char *name){
	int id = 0;
	for(int i=0;i<3;i++){
		id = 26*id +(name[i]-'A');
	}
	id = id*10 + (name[3] - '0');
	return id;
}
const int maxn = 26*26*26*10+10;
vector<int> v[maxn];
int main(){
	int n, k, no, num, id =0;
	char name[5];
	scanf("%d%d", &n, &k);
	for(int i=0;i<k;i++){
		scanf("%d%d",&no, &num);
		for(int j=0;j<num;j++){
			scanf("%s", name);
			id = gedit(name);
			v[id].push_back(no);
		}
	}
	for(int i=0;i<n;i++){
		scanf("%s", name);
		id = gedit(name);
		sort(v[id].begin(), v[id].end());
		printf("%s %lu", name, v[id].size());
		for(int j=0;j<v[id].size();j++)
			printf(" %d", v[id][j]);
		printf("\n");
	}
	system("pause");
	return 0;
}