#include <bits/stdc++.h>
using namespace std;
const int n = 28558, m = 3919;

static const int STORE[26] = {2,3,2,2,3,2,2,2,2,2,2,3,3,2,2,2,1,3,3,2,2,2,2,1,2,2};

struct password{
    string s;
    unsigned long long mask;
    password() {}
    password(const string &s): s(s){
        int f[26]; memset(f, 0, sizeof f);
        for (char c: s) f[c - 'a']++;

        mask = 0;
        for (int i=0, pos=0; i<26; pos+=STORE[i], i++){
            int w = f[i] < STORE[i] ? f[i] : STORE[i];
            mask |= ((1ULL << w) - 1) << pos;
        }
    }
    friend bool is_subset(const password &subset, const password &a){
        return (subset.mask & a.mask) == subset.mask;
    }
    friend bool operator<(const password &a, const password &b){
        return a.s < b.s;
    }
};

password a[n], b[m];
pair<password, int> s[m];
int decode[m][m], encode[n][3];

void input_royal(){
    int N; cin >> N; assert(n == N);
    for (int i=0; i<n; i++){
        string s; cin >> s;
        a[i] = s;
    }

    int M; cin >> M; assert(m == M);
    for (int i=0; i<m; i++){
        string s; cin >> s;
        b[i] = s;
    }
    shuffle(b, b + m, mt19937(24));
    
    for (int i=0; i<m; i++)
        s[i] = {b[i], i};
    sort(s, s + m);

    bitset<m> c[n];
    pair<int, int> s[n];

    for (int i=0; i<n; i++){
        for (int j=0; j<m; j++)
            c[i][j] = is_subset(b[j], a[i]);
        s[i] = {c[i].count(), i};
    }
    sort(s, s+n);

    bitset<m> g[m];
    for (int i=0; i<m; i++) g[i].set();

    for (auto [_, v]: s){
        if (c[v].count() < 3) continue;
        int fx = -1, fy = -1, fz = -1;

        for (int x = c[v]._Find_first(); x < m; x = c[v]._Find_next(x)){
            bitset<m> vx = c[v] & g[x];
            for (int y = vx._Find_next(x); y < m; y = vx._Find_next(y)){
                if (g[x][y] == 0) continue;

                bitset<m> vxy = vx & g[y];
                for (int z = vx._Find_next(y); z < m; z = vxy._Find_next(z)){
                    if (g[y][z] == 0 || g[x][z] == 0) continue;
                    fx = x, fy = y, fz = z;
                    goto found;
                }
            }
        }
        for (int x = c[v]._Find_first(); x < m; x = c[v]._Find_next(x)){
            if (g[x][x] == 0) continue;
            fx = fy = fz = x;
            goto found;
        }

        throw runtime_error(a[v].s);

        found:
        g[fx][fy] = g[fy][fx] = g[fx][fz] = g[fz][fx] = g[fy][fz] = g[fz][fy] = 0;
        decode[fx][fy] = decode[fy][fx] = decode[fx][fz] = decode[fz][fx] = decode[fy][fz] = decode[fz][fy] = v;
        encode[v][0] = fx, encode[v][1] = fy, encode[v][2] = fz;
    }
}

void encode_string(string s){
    int pos = lower_bound(a, a + n, s) - a;
    cout << b[encode[pos][0]].s << " " << b[encode[pos][1]].s << " " << b[encode[pos][2]].s << "\n";
}
void decode_string(string x, string y){
    int xx = lower_bound(s, s + m, pair<password, int> (x, INT_MIN))->second;
    int yy = lower_bound(s, s + m, pair<password, int> (y, INT_MIN))->second;
    cout << a[decode[xx][yy]].s << "\n";
}

signed main(){
    cin.tie(0)->sync_with_stdio(0);
    string type; cin >> type;
    int n; cin >> n;
    vector<pair<string, string>> a(n);
    if (type == "password"){
        for (int i=0; i<n; i++)
            cin >> a[i].first;
    }
    else{
        for (int i=0; i<n; i++)
            cin >> a[i].first >> a[i].second;
    }

    input_royal();
    if (type == "password"){
        for (int i=0; i<n; i++){
            encode_string(a[i].first);
        }
    }
    else{
        for (int i=0; i<n; i++){
            decode_string(a[i].first, a[i].second);
        }
    }
}