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# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
class Program
{
    static int[,,] Tabel = new int[100000, 27, 27];
    class Node
    {
        public char c;
        public int leaves;
        public Node[] sons = new Node[27];
        public Node(char _c)
        {
            c = _c;
            leaves = 1;
            for (int ii = 0; ii < 27; ii++) sons[ii] = null;
        }
        public void AddWord(string _w, int _p)
        {
            if (_w.Length == (_p + 1)) 
            {
                this.sons[0] = new Node('_');
            }
            else
            {
                if (this.sons[_w[_p] - 'a' + 1] == null) this.sons[_w[_p] - 'a' + 1] = new Node(_w[0]);
                else this.sons[_w[_p] - 'a' + 1].leaves++;
                this.sons[_w[_p] - 'a' + 1].AddWord(_w, _p + 1);
            }
        }
        public void Count(string _w, int _p, int _q)
        {
            if (_w.Length == (_p + 1)) return;
            for (int ii = 0; ii <= 26; ii++)
                if (this.sons[ii] != null)
                    Tabel[_q, ii, _w[_p] - 'a' + 1] = Tabel[_q, ii, _w[_p] - 'a' + 1] + this.sons[ii].leaves;
            this.sons[_w[_p] - 'a' + 1].Count(_w, _p + 1, _q);
        }
        public void OutputWord()
        {
            Console.WriteLine(this.c + " " + this.leaves);
            for(int ii = 0; ii <= 26; ii++)
            {
                if (this.sons[ii] != null) this.sons[ii].OutputWord();
            }
        }
    }
    static void Main(string[] args)
    {
        Node root = new Node('_');
        string[] words = new string[100000];
        int n = int.Parse(Console.ReadLine());
        for (int i = 0; i < n; i++)
        {
            words[i] = Console.ReadLine();
            root.AddWord(words[i], 0);
        }
        for (int i = 0; i < n; i++) root.Count(words[i], 0, i);
        int q = int.Parse(Console.ReadLine());
        for (int i = 0; i < q; i++)
        {
            string[] input = Console.ReadLine().Split(' ');
            int m = int.Parse(input[0]);
            int ans = 1;
            for (int j = 0; j < 26; j++)
            {
                ans = ans + Tabel[m - 1, 0, input[1][j] - 'a' + 1];
                for (int k = j + 1; k < 26; k++)
                    ans = ans + Tabel[m - 1, input[1][j] - 'a' + 1, input[1][k] - 'a' + 1];
            }
            Console.WriteLine(ans);
        }
    }
}