#include <bits/stdc++.h>
using namespace std;
#define Seny ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(v) v.begin(),v.end()
#define print(v) for(auto x : v)cout<<x<<" "
#define ll long long
#define int ll
#define endl '\n'
const int mod = 1e9 + 7;
const int N = 2e5 + 5;

void kero()
{
    int n, k;
    cin >> n >> k;
    vector<queue<string>> prio(n);
    set<string> taken;
    for (int i = 0; i < n; ++i) {
        int t; cin >> t;
        while (t--) {
            string inp; cin >> inp;
            prio[i].push(inp);
        }
    }
    int p; cin >> p;
    deque<string> strs(p);
    for(int i = 0; i < p; i++)
        cin >> strs[i];
    vector<vector<string>> ans(n, vector<string>());
    for (int j = 0; j < n*k; ++j) {
            if(j >= p)
                break;
            int i = j % k;
            if(prio[i].size()) {
                while (prio[i].size() and taken.count(prio[i].front()))
                    prio[i].pop();
                if(prio[i].size()){
                    ans[i].push_back(prio[i].front());
                    taken.insert(prio[i].front());
                    prio[i].pop();
                    continue;
                }
            }
            while (strs.size() and taken.count(strs.front()))
                strs.pop_front();
        if(strs.size()){
            ans[i].push_back((strs.front()));
            taken.insert((strs.front()));
            strs.pop_front();
        }


    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < ans[i].size(); ++j) {
            cout << ans[i][j] << ((j == ans[i].size() - 1) ? "\n" : " ");
        }
//        cout << ((i == n - 1) ? "" : "\n");
    }
}
signed main() {
    Seny
    int t = 1;
    //cin >> t;
    while (t--)
        kero();
}