#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


char buf[110];

int M, N;
vector<string> A, B;
unordered_map<string, int> idsA, idsB;
vector<vector<int>> graph;
vector<vector<int>> f;
vector<vector<int>> g;

void dict() {
  scanf("%d", &M);
  A.resize(M);
  for (int i = 0; i < M; ++i) {
    scanf("%s", buf); A[i] = buf;
  }
  scanf("%d", &N);
  B.resize(N);
  for (int j = 0; j < N; ++j) {
    scanf("%s", buf); B[j] = buf;
  }
  
  idsA.clear();
  idsB.clear();
  for (int i = 0; i < M; ++i) idsA[A[i]] = i;
  for (int j = 0; j < N; ++j) idsB[B[j]] = j;
  graph.assign(M, {});
int numEdges=0;
  for (int i = 0; i < M; ++i) {
    string a = A[i];
    sort(a.begin(), a.end());
    do {
      const string b = a.substr(0, 4);
      auto it = idsB.find(b);
      if (it != idsB.end()) {
++numEdges;
        graph[i].push_back(it->second);
      }
      reverse(a.begin() + 4, a.end());
    } while (next_permutation(a.begin(), a.end()));
  }
cerr<<"numEdges = "<<numEdges<<endl;
  
  vector<int> degA(M, 0), degB(N, 0);
  for (int i = 0; i < M; ++i) {
    for (const int j : graph[i]) {
      ++degA[i];
      ++degB[j];
    }
  }
  vector<int> is;
  for (int i = 0; i < M; ++i) if (degA[i] >= 3) is.push_back(i);
  sort(is.begin(), is.end(), [&](int i0, int i1) -> bool {
    return (degA[i0] < degA[i1]);
  });
cerr<<"|is| = "<<is.size()<<endl;
  
  f.assign(M, vector<int>(3, -1));
  g.assign(N, vector<int>(N, -1));
int success=0;
  for (const int i : is) {
    auto &js = graph[i];
    const int jsLen = js.size();
    sort(js.begin(), js.end(), [&](int j0, int j1) -> bool {
      return (degB[j0] < degB[j1]);
    });
    for (int k0 = 0; k0 < jsLen; ++k0) {
      const int j0 = js[k0];
      for (int k1 = k0 + 1; k1 < jsLen; ++k1) {
        const int j1 = js[k1];
        if (!~g[j0][j1]) {
          for (int k2 = k1 + 1; k2 < jsLen; ++k2) {
            const int j2 = js[k2];
            if (!~g[j0][j2] && !~g[j1][j2]) {
              f[i][0] = j0;
              f[i][1] = j1;
              f[i][2] = j2;
              g[j0][j1] = g[j0][j2] = g[j1][j0] = g[j1][j2] = g[j2][j0] = g[j2][j1] = i;
              --degB[j0];
              --degB[j1];
              --degB[j2];
              goto found;
            }
          }
        }
      }
      if (!~g[j0][j0]) {
        f[i][0] = f[i][1] = f[i][2] = j0;
        g[j0][j0] = i;
        --degB[j0];
        goto found;
      }
    }
cerr<<"FAIL success = "<<success<<endl;
cerr<<A[i]<<": ";for(const int j:js)cerr<<B[j]<<" ";cerr<<endl;
    assert(false);
   found:{}
++success;
// cerr<<degA[i]<<" "<<A[i]<<": ";for(const int j:f[i])cerr<<B[j]<<" ";cerr<<endl;
  }
}

int main() {
  char typ[110];
  for (; ~scanf("%s", typ); ) {
    if (!strcmp(typ, "password")) {
      int Q;
      scanf("%d", &Q);
      vector<string> X(Q);
      for (int q = 0; q < Q; ++q) {
        scanf("%s", buf); X[q] = buf;
      }
      
      dict();
      
      for (int q = 0; q < Q; ++q) {
        const int i = idsA[X[q]];
        for (int k = 0; k < 3; ++k) {
          if (k) printf(" ");
          printf("%s", B[f[i][k]].c_str());
        }
        puts("");
      }
    } else if (!strcmp(typ, "keys")) {
      int Q;
      scanf("%d", &Q);
      vector<string> Y(Q), Z(Q);
      for (int q = 0; q < Q; ++q) {
        scanf("%s", buf); Y[q] = buf;
        scanf("%s", buf); Z[q] = buf;
      }
      
      dict();
      
      for (int q = 0; q < Q; ++q) {
        const int jY = idsB[Y[q]];
        const int jZ = idsB[Z[q]];
        puts(A[g[jY][jZ]].c_str());
      }
    } else {
      assert(false);
    }
  }
  return 0;
}