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: Wrong Answer)


#include <cstring>
#include <stdio.h>
#define MAXN (2000000)

class TrieNode {
public:
    bool exist;
    int  son_count;
    TrieNode* nodes[26]={0};
    TrieNode():son_count(0),exist(false){}
    TrieNode * & getNode(const char & chr)
    {
        return nodes[chr-'a'];
    }
}nodes[MAXN];

int nodes_cnt = 0;

class Trie {
public:
    Trie() {
        root = new TrieNode();
    }

    void insert(const char *  word) {
        TrieNode * now = root;
        while(*word)
        {
            now->son_count++;
            if(!now->getNode(*word))
                now = now->getNode(*word) = &nodes[nodes_cnt++];
            else
                now = now->getNode(*word);
            word++;
        }
        now->son_count ++;
        now->exist = true;
    }

    int get_rank(const char * word, const char * char_rank) {
        int rank = 1;
        TrieNode * now = root, *last = NULL, *tmp;
        while(*word)
        {
            for(int i = 0; char_rank[i] != *word; i++)
            {
                tmp = now->getNode(char_rank[i]);
                if(tmp)
                    rank+= tmp->son_count;
            }
            last = now;
            now = now->getNode(*word);
            word++;
            if(*word && last->exist)
                rank++;
        }
        return rank;
    }
private:
    TrieNode* root;
};
#define MAX_CHAR_LEN (5000000)
#define MAX_STR_CNT  (800000+5)

char char_buffer[MAX_CHAR_LEN];
char * str_table[MAX_STR_CNT];

int main()
{
    int N,Q,k;
    char char_rank[32], * ptr = char_buffer;
    Trie trie;
    scanf("%d",&N);
    for(int i = 0; i < N; i++)
    {
        str_table[i] = ptr;
        scanf("%s",ptr);
        trie.insert(ptr);
        ptr += strlen(ptr) + 1;
    }
    scanf("%d",&Q);
    for(int i = 0; i < Q; i++)
    {
        scanf("%d%s", &k, char_rank);
        int rank = trie.get_rank(str_table[k-1], char_rank);
        printf("%d\n", rank);
    }
    //printf("%d")
    return 0;
}