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 Java8 (OpenJDK 1.8.0) (judge verdict: Memory Limit Exceeded)

import java.util.Arrays;
import java.util.Scanner;

public class Main {

    static int[][] dp;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        String[] strs = new String[n];
        dp = new int[n][n];
        for (int i= 0; i < n; i ++) {
            strs[i] = sc.next();
            dp[i] = new int[n];
        }

        int q = sc.nextInt();
        for (int i= 0; i < q; i ++) {
            int k = sc.nextInt();
            String seq = sc.next();
            System.out.println(cal(strs, n , k - 1, seq));
        }
    }

    private static int cal(final String[] strs, final int n, final int k, final String seq) {
        int res = 0;
        for (int i = 0; i < n; i ++) {
            if (i != k) {
                if (comp(strs, i, k, seq)) {
                    res ++;
                }
            }
        }
        return n - res;
    }

    private static boolean comp(final String[] strs, final int str, final int str1, final String seq) {
        int[] seqA = new int[26];
        for (int i = 0; i < 26; i ++) {
            seqA[seq.charAt(i) - 'a'] = i;
        }
        char[] ch = strs[str].toCharArray();
        char[] ch1 = strs[str1].toCharArray();
        int l = ch.length;
        int l1 = ch1.length;
        int dpn = (str < str1) ? dp[str][str1] : dp[str1][str];
        for (int i = dpn; i < l && i < l1; i++) {
            int c1 = seqA[ch[i] - 'a'];
            int c2 = seqA[ch1[i] - 'a'];
            if (c1 < c2) {
                return false;
            } else if (c1 > c2) {
                return true;
            } else {
                if (str < str1) {
                    dp[str][str1] = i + 1;
                } else {
                    dp[str1][str] = i + 1;
                }
            }
        }
        if (l < l1) {
            return false;
        }
        return true;
    }

}