#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int maxA = 3e4;
const int maxB = 4e3;
string big[maxA];
string small[maxB];
int f[maxB][maxB];
vector<int> g[maxA];
int n0, n1;
int cnt[26];
int new_cnt[26];
int ans[maxA][3];
int deg[maxB];
void build() {
    memset(f, -1, sizeof f);
    cin >> n0;
    for (int i = 0; i < n0; i++) {
        cin >> big[i];
    }
    cin >> n1;
    for (int i = 0; i < n1; i++) {
        cin >> small[i];
    }
    assert(n0 == 28558 && n1 == 3919);
    for (int i = 0; i < n0; i++) {
        for (char& c : big[i]) {
            cnt[c - 'a']++;
        }
        for (int j = 0; j < n1; j++) {
            bool ok = true;
            for (char& c : small[j]) {
                new_cnt[c - 'a']++;
                if (cnt[c - 'a'] < new_cnt[c - 'a']) ok = false;
            }
            for (char& c : small[j]) {
                new_cnt[c - 'a']--;
            }
            if (ok) {
                g[i].emplace_back(j);
                deg[j]++;
            }
        }
        for (char& c : big[i]) {
            cnt[c - 'a']--;
        }
    }
    vector<int> r(n0);
    iota(r.begin(), r.end(), 0);
    sort(r.begin(), r.end(), [&](int x, int y){
        return (int)g[x].size() < (int)g[y].size();
    });
    for (int t : r) {
        if ((int)g[t].size() < 3) continue;
        bool fnd = false;
        for (int a = 0; a < g[t].size(); a++) {
            if (fnd) break;
            for (int b = a; b < g[t].size(); b++) {
                if (fnd) break;
                if (f[g[t][a]][g[t][b]] != -1) continue;
                for (int c = b; c < g[t].size(); c++) {
                    if (f[g[t][a]][g[t][c]] != -1 || f[g[t][b]][g[t][c]] != -1) continue;
                    fnd = true;
                    f[g[t][a]][g[t][b]] = f[g[t][b]][g[t][a]] = t;
                    f[g[t][a]][g[t][c]] = f[g[t][c]][g[t][a]] = t;
                    f[g[t][b]][g[t][c]] = f[g[t][c]][g[t][b]] = t;
                    ans[t][0] = g[t][a];
                    ans[t][1] = g[t][b];
                    ans[t][2] = g[t][c];
                    break;
                }
            }
        }
//        if (!fnd) {
//            cout << " BAD " << endl;
//        }
//        if (!fnd) {
//            cout << " BAD " << endl;
//            cout << f[2305][2328] << " ???? " << endl;
//            exit(0);
//        }
//        assert(fnd);
    }
}
void solve_password() {
    int n;
    cin >> n;
    vector<string> s(n);
    for (int i = 0; i < n; i++) {
        cin >> s[i];
    }
    build();
    map<string,int> mp;
    for (int i = 0; i < n0; i++) {
        mp[big[i]] = i;
    }
    for (int i = 0; i < n; i++) {
        int id = mp[s[i]];
        for (int x = 0; x < 3; x++) {
            cout << small[ans[id][x]] << " ";
        }
        cout << '\n';
    }
}
void solve_keys() {
    int m;
    cin >> m;
    vector<string> p0(m), p1(m);
    for (int i = 0; i < m; i++) {
        cin >> p0[i] >> p1[i];
    }
    build();
    map<string, int> mp;
    for (int i = 0; i < n1; i++) {
        mp[small[i]] = i;
    }
    for (int i = 0; i < m; i++) {
        int id1 = mp[p0[i]];
        int id2 = mp[p1[i]];
        cout << big[f[id1][id2]] << '\n';
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    string s;
    cin >> s;
    if (s == "password") {
        solve_password();
    }
    else {
        solve_keys();
    }
    return 0;
}