/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/

#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define pb push_back
#define ff first
#define ss second
#define isz(x) (int)x.size()
#define For(i, x, y) for (int i = x; i < y; ++i)
using namespace std;

const int mxN = 1e6 + 5;
const int mod = 1e9 + 7;
const i64 oo = 1e18;

mt19937_64 rng(312008);

int n8, n4;
vector<string> dict8, dict4;
vector<int> G8[mxN], G4[mxN];
map<string, vector<int>> mp;
map<pair<int, int>, int> mp4;
map<int, array<int, 3>> mp8;

void prep() {
    cin >> n8;
    dict8.resize(n8);
    for (auto &s : dict8) cin >> s;

    cin >> n4;
    dict4.resize(n4);
    for (int i = 0; i < n4; ++i) {
        cin >> dict4[i];
        string tmp = dict4[i];
        sort(all(tmp));
        mp[tmp].emplace_back(i);
    }

    for (int i = 0; i < n8; ++i) {
        vector<int> cnt(26);
        for (char ch : dict8[i]) cnt[ch - 'a']++;
        string cur = "";
        auto dfs = [&](auto dfs, int v) -> void {
            if (v == 26) {
                if (isz(cur) == 4 and mp.contains(cur)) {
                    for (int j : mp[cur]) {
                        G8[i].emplace_back(j);
                        G4[j].emplace_back(i);
                    }
                }
                return;
            }
            int pre = isz(cur);
            for (int i = 0; i <= cnt[v]; ++i) {
                dfs(dfs, v + 1);
                cur.push_back(v + 'a');
            }
            cur.resize(pre);
        };
        dfs(dfs, 0);
        // if (G8[i].empty()) cout << i << endl;
    }

    vector<int> idx(n8);
    iota(all(idx), 0);
    sort(all(idx), [&](int x, int y) {
        return isz(G8[x]) < isz(G8[y]);
    });

    auto check = [&](int x, int y) -> bool {
        if (x > y) swap(x, y);
        return not mp4.contains({x, y});
    };

    auto add = [&](int x, int y, int i) -> void {
        if (x > y) swap(x, y);
        mp4[{x, y}] = i;
    };

    auto checkdiff = [&](int i) -> bool {
        int sz = isz(G8[i]);
        For(j, 0, sz) For(k, 0, j) if (check(G8[i][j], G8[i][k])) {
            For(l, 0, k) if (check(G8[i][j], G8[i][l]) and check(G8[i][k], G8[i][l])) {
                mp8[i] = {G8[i][j], G8[i][k], G8[i][l]};
                add(G8[i][j], G8[i][k], i);
                add(G8[i][j], G8[i][l], i);
                add(G8[i][k], G8[i][l], i);
                return true;
            }
        }
        return false;
    };

    auto checksame = [&](int i) -> bool {
        int sz = isz(G8[i]);
        For(j, 0, sz) if (check(G8[i][j], G8[i][j])) {
            mp8[i] = {G8[i][j], G8[i][j], G8[i][j]};
            add(G8[i][j], G8[i][j], i);
            return true;
        }
        return false;
    };

    for (int i : idx) if (isz(G8[i]) >= 3) {
        shuffle(all(G8[i]), rng);
        // sort(all(G8[i]), [&](int x, int y) {
        //     return isz(G8[x]) < isz(G8[y]);
        // });
        assert(checkdiff(i) or checksame(i));
    }
}

void password() {
    int n; cin >> n;
    vector<string> v(n);
    for (auto &s : v) cin >> s;

    prep();
    
    for (auto s : v) {
        int idx = lower_bound(all(dict8), s) - dict8.begin();
        auto [x, y, z] = mp8[idx];
        cout << dict4[x] << " " << dict4[y] << " " << dict4[z] << endl;
    }
}

void keys() {
    int n; cin >> n;
    vector<pair<string, string>> v(n);
    for (auto &[s, t] : v) cin >> s >> t;

    prep();

    for (auto [s, t] : v) {
        int x = lower_bound(all(dict4), s) - dict4.begin();
        int y = lower_bound(all(dict4), t) - dict4.begin();
        if (x > y) swap(x, y);
        cout << dict8[mp4[{x, y}]] << '\n';
    }
}

string name;

void solve() {
    cin >> name;
    if (name == "password") password();
    else keys();
}

signed main() {

#ifndef CDuongg
    if(fopen(taskname".inp", "r"))
        assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.ans", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
   auto end = chrono::high_resolution_clock::now();
   cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
   cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
   cout << "Check array size pls sir" << endl;
#endif

}