Problem:
Score : 1100 points

Problem Statement

There are N strings of lowercase alphabet only. The i-th string is S_i. Every string is unique.

Provide answers for the Q queries below. The i-th query has the following format:

Query: An integer k_i and a string p_{i,1}p_{i,2}...p_{i,26} that results from permuting {a,b,...,z} are given. Output the sequence of the string S_{k_i} among the N strings in lexicographical order when the literal sequence is p_{i,1}<p_{i,2}<...<p_{i,26}.

Constraints

1 ≦ N,Q ≦ 100000

1 ≦ |S_i| (1 ≦ i ≦ N)

S_i (1 ≦ i ≦ N) is a string of lowercase alphabet.

The sum of |S_i| is no more than 400000.

Every S_i is unique.

1 ≦ k_i ≦ N (1 ≦ i ≦ Q)

For all 1 ≦ i ≦ Q, p_{i,1}p_{i,2}...p_{i,26} is a permutation of abcd...z.

Input

Inputs are provided from standard inputs in the following form.

N
S_1
:
S_N
Q
k_1 p_{1,1}p_{1,2}...p_{1,26}
:
k_Q p_{Q,1}p_{Q,2}...p_{Q,26}

Output

Output Q lines.

On line i, for the i-th query, output an integer indicating the sequence of the string S_{k_i} among the N strings in lexicographical order.

Sample Input 1

5
aa
abbaa
abbba
aaab
aaaaaba
5
1 abcdefghijklmnopqrstuvwxyz
2 bacdefghijklmnopqrstuvwxyz
3 abcdefghijklmnopqrstuvwxyz
4 bacdefghijklmnopqrstuvwxyz
5 abcdefghijklmnopqrstuvwxyz

Sample Output 1

1
2
5
4
2

When the literal sequence is a < b, sorting the input strings in lexicographical order yields aa, aaaaaba, aaab, abbaa, abbba. The answers to queries 1, 3, and 5 are thus 1, 5, and 2, respectively.

When the literal sequence is b < a, sorting the input strings in lexicographical order yields abbba, abbaa, aa, aaab, aaaaaba. The answers to queries 2 and 4 are thus 2 and 4, respectively.

Sample Input 2

8
abrakatabra
abadaba
abracadabra
atcoder
grand
contest
ababa
a
6
3 abcdefghijklmnopqrstuvwxyz
6 qwertyuiopasdfghjklzxcvbnm
8 poiuytrewqlkjhgfdsamnbvcxz
2 qazwsxedcrfvtgbyhnujmikolp
1 plokmijnuhbygvtfcrdxeszwaq
4 mnbvcxzasdfghjklpoiuytrewq

Sample Output 2

4
8
2
3
4
7

Solution in C++14 (GCC 5.4.1) (judge verdict: Time Limit Exceeded)

#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <utility>
#include <array>

using namespace std;

struct node_type {
    node_type(node_type* p)
        : terminal{false}, size{0}, parent{p}, next{nullptr}
    {
    }
    bool terminal;
    int size;
    node_type* parent;
    array<node_type*, 26> next;
};

node_type* add(node_type* node, string::const_iterator c)
{
    ++node->size;
    if (*c == 0) {
        node->terminal = true;
        return node;
    } else {
        auto& child = node->next[*c - 'a'];
        if (child == nullptr) child = new node_type(node);
        return add(child, next(c));
    }
}

void dump_vector(const vector<int>& vec)
{
    for (const auto& v: vec) cout << v << " ";
    cout << endl;
}

void leftpad(int depth)
{
    for (int i = 0; i < depth; ++i) cout << ' ';
}

void dump(node_type* root, int depth = 0)
{
    leftpad(depth); cout << root << " " << root->parent << " " << root->size << " " << (root->terminal ? "<terminal>" : "") << endl;
    for (size_t i = 0; i < root->next.size(); ++i) {
        auto& child = root->next[i];
        if (child == nullptr) continue;
        leftpad(depth); cout << static_cast<char>('a' + i) << endl;
        dump(child, depth + 1);
    }
}

int find(node_type* node, vector<int>& order, int count)
{
    auto& parent = node->parent;
    if (parent == nullptr) return count;
    for (auto i: order) {
        auto& child = parent->next[i];
        if (child == node) break;
        if (child) count += child->size;
    }
    if (node->terminal) ++count;
    return find(parent, order, count);
}

int main()
{
    int N;
    cin >> N;
    auto root = new node_type(nullptr);
    vector<node_type*> nodes(N, nullptr);
    for (int i = 0; i < N; ++i) {
        string s; cin >> s;
        nodes[i] = add(root, s.cbegin());
    }

    // dump(root);
    
    int Q;
    cin >> Q;
    vector<int> order(26);
    for (int i = 0; i < Q; ++i) {
        size_t ith;
        cin >> ith;
        
        for (auto& o: order) {
            char c; cin >> c;
            o = c - 'a';
        }

        cout << find(nodes[ith-1], order, 0) << endl;
    }
    return 0;
}