#include <iostream>
#include<bits/stdc++.h>
#define int long long
#define FIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

using namespace std;

const int N = 1e6 + 5, M = 1e6 + 5;
const int mod = 5318008;
void debug() {
#ifdef Debug
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif
}

void getAnswer()
{
    int n,k;
    cin >> n >> k;
    vector<string> ans[65];
    deque<string> req[65], rem;
    map<int,int> mp;
    map<string,int> done;
    for(int i = 0;i < n;++i)
    {
        int q;
        cin >> q;
        vector<string> cur;
        for(int j = 0;j < q;++j)
        {
            string s;
            cin >> s;
            req[i].push_back(s);
        }
    }
    int ls;
    cin >> ls;
    for(int i = 0;i < ls;++i)
    {
        string s;
        cin >> s;
        rem.push_back(s);
        done[s] = 1;
    }
    while(mp.size() != n)
    {
        for(int j = 0;j < n;++j)
        {
            if(ans[j].size() != k)
            {
                while(!req[j].empty() and
                    !done[req[j].front()])
                {
                    req[j].pop_front();
                }
                while(!rem.empty() and !done[rem.front()])
                     rem.pop_front();
                if(req[j].empty())
                {
                    ans[j].push_back(rem.front());
                    rem.pop_front();
                }
                else
                {
                    ans[j].push_back(req[j].front());
                    if(req[j].front() == rem.front())
                        rem.pop_front();
                    req[j].pop_front();
                }
                //cout << ans[j].back() << " ";
                done[ans[j].back()] = 0;
            }
            else
                mp[j] = 1;
        }
    }
    for(int i = 0;i < n;++i)
    {
        for(auto &j : ans[i])
            cout << j << " ";
        cout << "\n";
    }
}       
signed main() 
{
    FIO
    debug();
    int t = 1;
    //cin >> t;
    while(t--)
        getAnswer();
    return 0;

}