#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;
    int x;
    map<string, pair<int, int>>mp;
    // idx,par
    string s;
    forn(i, n) {
        cin >> x;
        forn(j, x) {
            cin >> s;
            if (!mp.count(s)) {
                mp[s] = { j,i };
            }
            else {
                if (mp[s].first > j) {
                    mp[s] = { j,i };
                }
            }
        }
    }
    int q;
    cin >> q;
    vector<string>v(q + 5);
    forn(i, q) {
        cin >> v[i];
    }
    map<int, vector<string>>ans;
    vector<bool>vis(q, 0);
    forn(i, q) {
        if (!mp.count(v[i]))continue;
        else {
            if (ans[mp[v[i]].second].size() < k) {
                ans[mp[v[i]].second].push_back(v[i]);
                vis[i] = 1;
                mp.erase(v[i]);
            }
        }
    }
    int turn = 0;
    forn(j, q) {
        if (!vis[j] && ans[turn].size() < k) {
            ans[turn].push_back(v[j]);
            vis[j] = 1;
            turn = (turn + 1) % n;
        }
    }
    forn(i, n) {
        for (auto gg : ans[i])cout << gg << " ";
        ell;
    }



    return 0;
}