#include<bits/stdc++.h>
#include<unordered_map> 
#define print(v,T) copy(v.begin(), v.end(), ostream_iterator<T>(cout, " "));
#define TATAKAAI ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define el "\n"
#define ell cout<<"\n"
#define forn(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define forb(i, n) for (int i = n-1; i >= 0; i--)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
using namespace std;

const ll N = 1000000007;
int dy[] = { 1,-1,0,0,1,-1 };
int dx[] = { 0,0,-1,1,1,-1 };

int main() {
    TATAKAAI;
    ll n, k;
    cin >> n >> k;
    map<int, vector<string>>mp, ans;
    map<string, bool>vis;
    int x;
    string s;
    forn(i, n) {
        cin >> x;
        while (x--) {
            cin >> s;
            mp[i].push_back(s);
        }
    }
    int q;
    cin >> q;
    vector<string>v(q);
    forn(i, q)cin >> v[i];

    int turn = 0;
    while (k--) {
        forn(i, n) {
            bool fu = 0;
            for (auto it : mp[i]) {
                if (!vis[it]) {
                    vis[it] = 1;
                    ans[i].push_back(it);
                    fu = 1;
                    break;
                }
            }
            if (!fu) {
                forn(j, q) {
                    if (!vis[v[j]]) {
                        vis[v[j]] = 1;
                        ans[i].push_back(v[j]);
                        fu = 1;
                        break;
                    }
                }
            }
        }
    }
    for (auto it : ans) {
        print(it.second, string);
        ell;
    }


    return 0;
}