#include <bits/stdc++.h>
using namespace std;

int num[26][26][100000];
int offset[100000];

template<typename T>
struct Trie{
    static const int C = 26;
    struct Node{
        Node* ch[C];
        vector<T> val;
        int exact;
        Node(){
            exact = 0;
            fill(ch, ch+C, nullptr);
        }
    };

    Node* root;
    char start;

    Trie(char start='a'):start(start){ root = new Node(); }
    
    int getsize(Node* node){ return node ? node->val.size() : 0; }
    
    void add(Node* node, int d, const string& S, T v){
        node->val.push_back(v);
        if(S.size() == d){
            node->exact++;
        }else{
            int c = S[d] - start;
            if(!node->ch[c]) node->ch[c] = new Node();
            add(node->ch[c], d+1, S, v);
        }
    }
    void add(const string& S, T v){ add(root, 0, S, v); }

    void calc(Node* node){
        for(int i=0; i<C; i++) if(node->ch[i]) for(auto idx : node->ch[i]->val){
            offset[idx] += node->exact;
            for(int j=0; j<C; j++) if(i != j) num[i][j][idx] += getsize(node->ch[j]);
        }
        for(int c=0; c<C; c++) if(node->ch[c]) calc(node->ch[c]);
    }
    void calc(){ calc(root); }
};


int main(){
    int N;
    cin >> N;

    Trie<int> trie;
    for(int i=0; i<N; i++){
        string s;
        cin >> s;
        trie.add(s, i);
    }

    trie.calc();

    int Q;
    cin >> Q;
    while(Q--){
        int k;
        string s;
        cin >> k >> s;
        k--;
        int ord = offset[k] + 1;
        vector<int> order(26);
        for(int i=0; i<26; i++) order[s[i] - 'a'] = i;
        for(int i=0; i<26; i++) for(int j=0; j<26; j++) if(order[i] > order[j]) ord += num[i][j][k];
        cout << ord << endl;
    }

    return 0;
}

### Prompt

Your task is to create a Cpp solution to the following problem:

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.

Examples

Input

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


Output

1
2
5
4
2


Input

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


Output

4
8
2
3
4
7

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;

int num[26][26][100000];
int offset[100000];

template<typename T>
struct Trie{
    static const int C = 26;
    struct Node{
        Node* ch[C];
        vector<T> val;
        int exact;
        Node(){
            exact = 0;
            fill(ch, ch+C, nullptr);
        }
    };

    Node* root;
    char start;

    Trie(char start='a'):start(start){ root = new Node(); }
    
    int getsize(Node* node){ return node ? node->val.size() : 0; }
    
    void add(Node* node, int d, const string& S, T v){
        node->val.push_back(v);
        if(S.size() == d){
            node->exact++;
        }else{
            int c = S[d] - start;
            if(!node->ch[c]) node->ch[c] = new Node();
            add(node->ch[c], d+1, S, v);
        }
    }
    void add(const string& S, T v){ add(root, 0, S, v); }

    void calc(Node* node){
        for(int i=0; i<C; i++) if(node->ch[i]) for(auto idx : node->ch[i]->val){
            offset[idx] += node->exact;
            for(int j=0; j<C; j++) if(i != j) num[i][j][idx] += getsize(node->ch[j]);
        }
        for(int c=0; c<C; c++) if(node->ch[c]) calc(node->ch[c]);
    }
    void calc(){ calc(root); }
};


int main(){
    int N;
    cin >> N;

    Trie<int> trie;
    for(int i=0; i<N; i++){
        string s;
        cin >> s;
        trie.add(s, i);
    }

    trie.calc();

    int Q;
    cin >> Q;
    while(Q--){
        int k;
        string s;
        cin >> k >> s;
        k--;
        int ord = offset[k] + 1;
        vector<int> order(26);
        for(int i=0; i<26; i++) order[s[i] - 'a'] = i;
        for(int i=0; i<26; i++) for(int j=0; j<26; j++) if(order[i] > order[j]) ord += num[i][j][k];
        cout << ord << endl;
    }

    return 0;
}

```