/** gnu specific **/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/** contains everything I need in std **/
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, n) for(int i = 0; i < n; ++i)
#define RFOR(i, n) for(int i = n-1; i >= 0; --i)
#define output_vec(vec) { FOR(i_, sz(vec)) cout << vec[i_] << ' '; cout << '\n'; }
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef vector<bool> vb;
typedef short si;
typedef unsigned long long ull;
typedef long double LD;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif

const int MOD = 998244353;
const int N = 7047;
ll twos[N];
ll prefs[N];

ll binPow(ll a, ll b)
{
	ll res = 1;
	while (b)
	{
		if (b & 1)
		{
			res = res * a % MOD;
		}
		a = a * a % MOD;
		b >>= 1;
	}
	return res;
}

void pre()
{
	twos[0] = 1;
	twos[1] = 2;
	ll num = 4;
	int i = 2;
	while (i < N)
	{
		twos[i++] = num;
		num = num * 2 % MOD;
	}
	i = 1;
	while (i < N)
	{
		prefs[i] = (prefs[i - 1] + twos[i - 1]) % MOD;
		i++;
	}
}

int solve()
{
	int n, k;
	cin >> n >> k;
	vector<string> a(n), cats(k);
	map<string, int> cnt;
	FOR (i, n) {
		cin >> a[i];
		cnt[a[i]]++;
	}
	FOR (i, k) cin >> cats[i];
	
	map<string, int> ord;
	FOR (i, k)
	{
		ord[cats[i]] = i;
	}
	
	vector<pair<int, string>> ans;
	FOR (i, k)
	{
		string s;
		cin >> s;
		int nn;
		cin >> nn;
		int o = ord[s];
		FOR (j, nn)
		{
			string curr;
			cin >> curr;
			if (cnt.count(curr))
			{
				ans.pb({o, curr});
			}
		}
	}
	
	sort(all(ans));
	FOR (i, sz(ans))
	{
		int tt = cnt[ans[i].y];
		while (tt--)
		{
			cout << ans[i].y << '\n';
		}
	}
	
	return 0;
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1;
    //cin >> TET;
    for (int i = 1; i <= TET; i++)
    {
        if (solve())
        {
            break;
        }
#ifdef ONPC
        cout << "__________________________" << endl;
#endif
    }
#ifdef ONPC
    cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif
}