B

#include <algorithm>
#include <iostream>
#include <array>
#include <vector>
#include <numeric>
#include <random>
#include <chrono>
#include <set>


using namespace std;

#define int long long
#pragma comment(linker,"/STACK:1000000000,1000000000")

const long long INF = 1e9 + 7;
const int MAXN = 1e4 + 5;
const int N = 1e5 + 10;

struct vertex {
    int next[26];
    int terminal = 0;
    string t;
} v[MAXN];

int root = 0, top = 1;

void add(const string& s, int num) {
    int cur = root;
    for (auto& i: s) {
        int x = i - 'a';
        if (v[cur].next[x] == 0) {
            v[cur].next[x] = top++;
        }
        cur = v[cur].next[x];
    }
    v[cur].terminal = num;
    v[cur].t = s;
}

array<vector<pair<int, string>>, MAXN> dp;

bool comp(const pair<int, string>& lhs, const pair<int, string>& rhs) {
    return lhs.first > rhs.first || lhs.first == rhs.first && lhs.second < rhs.second;
}

void dfs(int ver) {
    for (int i = 0; i < 26; ++i) {
        if (v[ver].next[i] != 0) {
            dfs(v[ver].next[i]);
            for (auto& elem: dp[v[ver].next[i]]) {
                dp[ver].emplace_back(elem);
            }
            sort(dp[ver].begin(), dp[ver].end(), comp);
            while (dp[ver].size() > 10) {
                dp[ver].pop_back();
            }
        }
    }
    if (v[ver].terminal != 0) {
        dp[ver].emplace_back(v[ver].terminal, v[ver].t);
    }
}

vector<vector<string>> answers;

void get(const string& s) {
    int cur = root;
    for (auto& i: s) {
        int x = i - 'a';
        cur = v[cur].next[x];
    }
    if (cur == 0) {
        return;
    }
    sort(dp[cur].begin(), dp[cur].end(), comp);
    while (dp[cur].size() > 10) {
        dp[cur].pop_back();
    }
    answers.emplace_back(vector<string>());
    for (auto [num, hint]: dp[cur]) {
        answers.back().emplace_back(hint);
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        string s;
        int num;
        cin >> s >> num;
        add(s, num);
    }

    dfs(0);

    int m;
    cin >> m;
    for (int i = 0; i < m; ++i) {
        string s;
        cin >> s;
        get(s);
    }

    for (int i = 0; i < answers.size(); ++i) {
        for (int j = 0; j < answers[i].size(); ++j) {
            cout << answers[i][j] << '\n';
        }
        if (i != answers.size() - 1) {
            cout << '\n';
        }
    }
}