// clang-format off
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <bitset>
#include <vector>
#include <algorithm>
#include <random>
#include <map>
#include <string>
#include <set>
#include <deque>
#include <string>
#include <cassert>

using namespace std;
const int N = 2e5 + 7;

struct Word {
    string s;
    int cnt[26];
    void init() {
        for (int i = 0; i < 26; i++) {
            cnt[i] = 0;
        }
        for (auto u : s) {
            cnt[u - 'a'] ++;
        }
    }
};

set<int> poss_masks;
vector<int> sorted;

int GetInd(int mask) {
    if (*(lower_bound(sorted.begin(), sorted.end(), mask)) != mask) {
        return -1;
    }
    return lower_bound(sorted.begin(), sorted.end(), mask) - sorted.begin();
}

bool can(Word& a, Word& b) {
    for (int i = 0; i < 26; i++) {
        if (a.cnt[i] > b.cnt[i]) {
            return 0;
        }
    }
    return 1;
}

vector<string> s, answ;

vector<Word> dict[N];

int n;

signed main() {
#ifdef _DEBUG
    freopen("input.txt", "r", stdin);
#else
    std::ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cin >> n;
    s.resize(n);
    for (int i = 0; i < n; i++) {
        cin >> s[i];
        int mask = 0;
        for (auto u : s[i]) {
            mask |= (1 << (u - '0'));
        }
        poss_masks.insert(mask);
    }
    for (auto u : poss_masks) {
        sorted.push_back(u);
    }
    for(int i = 0; i < n; i++){
        int mask = 0;
        for (auto u : s[i]) {
            mask |= (1 << (u - '0'));
        }
        int ind = GetInd(mask);
        Word kek;
        kek.s = s[i];
        kek.init();
        dict[ind].push_back(kek);
    }
    int q;
    cin >> q;
    for (int I = 0; I < q; I++) {
        answ.clear();
        string s;
        cin >> s;
        int mask = 0;
        for (auto u : s) {
            mask |= (1 << (u - '0'));
        }
        Word kek;
        kek.s = s;
        kek.init();
        for (int msk2 = mask; msk2 > 0; msk2--, msk2 &= mask) {
            int ind = GetInd(msk2);
            if (ind == -1) {
                continue;
            }

            for (auto& w : dict[ind]) {
                if (can(w, kek)) {
                    answ.push_back(w.s);
                }
            }
        }
        sort(answ.begin(), answ.end());
        cout << answ.size() << "\n";
        for (auto u : answ) {
            cout << u << "\n";
        }
    }

}