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 Rust (1.42.0) (judge verdict: Accepted)

use proconio::*;
use proconio::marker::*;

type Link = Option<Box<Node>>;

#[derive(Default)]
struct Node {
    cnt: u32,
    next: [Link; 26],
}

fn insert(node: &mut Link, s: &[u8]) {
    if node.is_none() {
        *node = Some(Box::new(Node::default()));
    }
    let node = node.as_mut().unwrap();
    node.cnt += 1;
    if s.len() > 0 {
        let k = (s[0] - b'a') as usize;
        insert(&mut node.next[k], &s[1..]);
    }
}

fn dfs(node: &Link, s: &[u8], add: &mut u32, cnt: &mut [[u32; 26]]) {
    let node = node.as_ref().unwrap();
    let sum = node.next.iter().fold(0, |s, p| s + p.as_ref().map_or(0, |p| p.cnt));
    *add += node.cnt - sum;
    if s.len() > 0 {
        let k = (s[0] - b'a') as usize;
        for (cnt, next) in cnt[k].iter_mut().zip(node.next.iter()) {
            *cnt += next.as_ref().map_or(0, |p| p.cnt);
        }
        dfs(&node.next[k], &s[1..], add, cnt);
    }
}

#[fastout]
fn run() {
    input! {
        n: usize,
        s: [Bytes; n],
        q: usize,
        ask: [(Usize1, Bytes); q],
    }
    let mut root = None;
    for s in s.iter() {
        insert(&mut root, s);
    }
    let mut memo = vec![];
    for s in s.iter() {
        let mut cnt = [[0; 26]; 26];
        let mut add = 0;
        dfs(&root, s, &mut add, &mut cnt);
        memo.push((add, cnt));
    }
    for (k, ask) in ask {
        let memo = &memo[k];
        let mut ans = memo.0;
        for i in 1..26 {
            let a = (ask[i] - b'a') as usize;
            for j in 0..i {
                let b = (ask[j] - b'a') as usize;
                ans += memo.1[a][b];
            }
        }
        println!("{}", ans);
    }
}

fn main() {
    run();
}