1039

#include<iostream>
#include<string>
#include<map>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
	map<string, vector<int>> S;
	int n, k;
	cin >> n >> k;
	for (int i = 0; i < k; i++)
	{
		int course, num;
		cin >> course >> num;
		for (int j = 0; j < num; j++)
		{
			string name;
			char name2[10];
			scanf("%s", name2);
			name = name2;
			/*name.resize(4);
			scanf("%s", &name[0]);*/
			S[name].push_back(course);
		}
	}
	/*for (auto const& p : S)
	{
	cout << p.first << ' '<<p.second.size();
	for (auto iter = p.second.begin(); iter != p.second.end(); iter++)
	{
	cout << ' ' << *iter;
	}
	cout << endl;
	}*/
	int t = n;
	while (t--)
	{
		string name;
		char name2[10];
		scanf("%s", name2);
		name = name2;
		/*name.resize(4);
		scanf("%s", &name[0]);*/
		sort(S[name].begin(), S[name].end());
		cout << name << ' ' << S[name].size();
		if (S[name].size())
		{
			for (auto iter = S[name].begin(); iter != S[name].end(); iter++)
			{
				cout << ' ' << *iter;
			}
		}
		cout << endl;


	}
	system("pause");
	return 0;
}